At the outset, I doubt whether this could qualify as a 700- level question. Because, there’s only one concept that is being tested here and that is the number of a diagonals of a polygon. If you are aware of this concept, there’s not much left in this question from that point on.
For a polygon with n sides, the number of line segments that belong to that polygon is given by \(n_C_2\). This is because, an n-sided polygon has n vertices of which any 2 need to be selected to form a line segment belonging to the polygon.
‘n’ of these line segments need to be removed since these represent the sides of the polygon. Once this is done, we will be left with (\(n_C_2\) - n) line segments that represent the diagonals of that polygon.
The number of diagonals of a n-sided polygon = \(n_C_2 \)– n.
Note that this formula is not restricted to regular polygons. It can be used for both regular and irregular polygons.
Side note:
A regular polygon is a polygon in which all the sides are equal and all the interior angles are equal, as is the case with the polygon defined in this question.
The value of n in this question is 9 since the question says the polygon has 9 sides. Therefore, number of diagonals of this polygon = \(9_C_2\) – 9 = (9*8/2) – 9 = 36 – 9 = 27.
The correct answer option is B.
Note that \(n_C_2\) = \(\frac{n(n-1) }{ 2}\).
Hope that helps!