Which is true statement in the followinga.Both of aboveb.Kruskal’s algorithm (choose best non-cycle edge) is better than prim’s(choose best tree edge) when the graph has relatively few edges.c.Kruskal’s algorithm is used to find MST of a graph , time complexity of this algorithm is O(EV)d.Kruskal’s algorithm is multiple source technique for finding MST.

Which of the following is true about Kruskal and Prim MST algorithms? Assume that Prim is implemented for adjacency list representation using Binary Heap and Kruskal is implemented using union by rank.a.Worst case time complexity of both algorithms is same.b.Worst case time complexity of Prim is better than Kruskalc.Noned.Worst case time complexity of Kruskal is better than Prim

Kruskal’s algorithm is used to ______Select one:a.find minimum spanning treeb.find single source shortest pathc.find all pair shortest path algorithmd.traverse the graph

Which algorithm is used to find the minimum spanning tree in a graph?A) Bellman-FordB) Kruskal'sC) Prim'sD) Dijkstra

When is Kruskal's algorithm commonly used in graph theory?A) To find the shortest path between two nodesB) To find the minimum spanning tree of a connected, undirected graphC) To calculate the average distance between nodesD) To find the maximum flow in a graph

The runtime complexity of Kruskal's algorithm for finding the Minimum Spanning Tree is:OptionsO(V log V)O(V^2) O(E^2)O(E log E)