A minimum spanning tree of an indirect weighted graph $G($with $N$ nodes and $E$ edges$)$ is a

tree formed from graph edges that connects all nodes of $G$ at lowest total cost.

Select one or more:

a$.$ Kruskal's algorithm can solve this problem in ElogE$+E$ if insertion sort is used $($to

sort the edges$).$

b$.$ Dynamic Programming is required to solve this problem.

c$.$ This problem can be solved using Kruskal's Algorithm.

d$.$ Kruskal's algorithm can solve this problem in $E+$ElogE if a heap structure is used.

e$.$ Kruskal's algorithm can solve this problem in ElogE$+E$ if merge sort is used $($to

sort the edges$).$

f$.$ In order to find the minimum spanning tree, the graph $G$ should be connected.