$A,B,C,D$ are four towns, any three of which are non-colinear. In how many ways can we construct three roads (each road joins a pair of towns) so that the roads do not form a triangle?
More than 9
Between 4 towns there are $\binom{6}{3}=20$ ways to choose 3 roads (edges of $K_4$). A triangle occurs only when the 3 chosen roads lie among some triple of towns; there are $4$ such triangles. Thus, non-triangle selections $=20-4=16\, (\>9)$. Hence option (d).
Instead of directly subtracting the number of triangles from the total, we can classify every possible set of \(3\) roads (edges) among the \(4\) towns by the shape they form, and check each option against the total count.
Since the actual number of ways to avoid forming a triangle is \(16\), which is greater than \(9\), only option D is consistent with this count.
Hence, the correct answer is option D: more than 9.
In a special racing event, the person who enclosed the maximum area would be the winner and would get ₹ 100 every square metre of area covered by him/her. Jonsson, who successfully completed the race and was the eventual winner, enclosed the area shown in the figure below. What is the prize money won?
\(\textit{Note: The arc from C to D makes a complete semi-circle. Given: }\) $AB=3$ m, $BC=10$ m, $CD=BE=2$ m.

A lawn is in the form of an isosceles triangle. The cost of turfing on it came to $₹ 1{,}200$ at ₹ 4 per m$^2$. If the base be 40 m long, find the length of each side.