Which of the following is true
S1: For any given graph G, Kruskal's and Prim's algorithms both give the same MST.
S2: The running time of Prim's algorithm can be improved if we use Fibonacci heap instead of min heap.
S3: Kruskal's algorithm uses disjoint-set data structure

(A) Only S1 and S2
(B) Only S2 and S3
(C) Only S1 and S3
(D) All


Discuss: (Answer-B)