Question: What is the time complexity of Prim\'s algorithm for finding the minimum spanning tree using an adjacency matrix?

Options:

1. O(V^2)
2. O(E log V)
3. O(V + E)
4. O(V^3)

Correct Answer: O(V^2)

Solution:

Prim\'s algorithm has a time complexity of O(V^2) when using an adjacency matrix.