Answer: (ii) Prim's algorithm

Explanation:

• MST algorithms: Prim's ($O(E \log V)$ with heap, $O(E+V\log V)$ with Fibonacci heap) and Kruskal's ($O(E \log E)$) both find Minimum Spanning Tree.
• Dijkstra's, Bellman-Ford, Floyd-Warshall are shortest-path algorithms, not MST.
• Among given options, (ii) Prim's is the only MST algorithm.

Note: Q81 lists Kruskal's as option (ii) — both Prim's and Kruskal's are correct MST algorithms; the exam chooses whichever appears in options.

Correct choice: (ii)