Answer: (ii) Kruskal's Algorithm

Explanation:

• Minimum Spanning Tree (MST) of a connected, undirected, weighted graph is found by greedy MST algorithms:
  • Prim's: grows tree from a vertex, repeatedly adds minimum-weight edge crossing cut. $O(E \log V)$.
  • Kruskal's: sorts all edges, adds edges in increasing order skipping those forming a cycle (using Union-Find). $O(E \log E)$.
• Dijkstra's, Bellman-Ford, Floyd-Warshall solve shortest paths, not MST.
• Both Prim's and Kruskal's are valid; here the option listed is Kruskal's.

Correct choice: (ii) Kruskal's Algorithm (Prim's would also be correct if listed).