If a graph is a complete graph with n vertices,then how many spanning tress a complete graph can have? Where n is the number of nodes in the graph.

A ) n( n + 1 )

B ) n(n + 1 )

C ) n2

D ) n( n+ 2) ✅