Question 1

Figure from the original question paper Figure from the original question paper Consider the given statements below about **Prim's algorithm's** behaviour and properties. i. The choice of the starting vertex can lead to different Minimum Spanning Trees if multiple MSTs exist with the same total weight.\ ii. Prim's algorithm first sorts all edges in the graph by weight.\ iii. The algorithm maintains a set of visited vertices and, at each step, selects the minimum weight edge connecting a visited vertex to an unvisited vertex.\ Which of the given statements are **True**?