Ace test series question on number of spanning trees possible

Question

Comments

60?

Answer 1

For a complete graph $K_n;$ Number of spanning trees$= n^{n-2}$

here $n=5$, So Number of spanning trees $= 5^{5-2} = 5^3 =125$

Answer 2

Answer$- 125$

Since it is a complete graph of $5$ vertices.

Hence no of spanning trees are $n^{n-2}$

$5^{5-2} =5^3=125$

Answer 3

$125$ as it is a complete graph hence $n^{n-2}$ will be the answer