Q. Kruskal’s algorithm can efficiently implemented using the disjoint-set data structure.
✅ Correct Answer: (D)
s2 is true but s1 is false
Explanation: in kruskal’s algorithm, the disjoint-set data structure efficiently identifies the components containing a vertex and adds the new edges. and kruskal’s algorithm always finds the mst for the connected graph.