Which is true statement in the following?

(A) Kruskal algorithm is multiple source technique for finding MST
(B) Kruskal’s algorithm is used to find minimum spanning tree of a graph, time complexity of this algorithm is O(EV)
(C) Both of above
(D) Kruskal’s algorithm (choose best non-cycle edge) is better than Prim’s (choose best Tree edge) when the graph has relatively few edges