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(V2)
C.	O(E2)
D.	O(V log E)
Answer» C. O(E2)