Worst case is the worst case time complexity of Prim s algorithm if adjacency matrix is used?

Worst case is the worst case time complexity of Prim s algorithm if ad

1.	Worst case is the worst case time complexity of Prim s algorithm if adjacency matrix is used?
A.	O(log V)
B.	O(V<sup>2</sup>)
C.	O(E<sup>2</sup>)
D.	O(V log E)
Answer» C. O(E<sup>2</sup>)