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 E $+$ E log E if a heap structure is used.O b$.$Dynamic Programming is required to solve this problem$\mathrm{.}0$ c$.$Kruskal's algorithm can solve this problem in E log E $+$ E if insertion sort is used $($to sort the edges$).$ d$.$ In order to find the minimum spanning tree, the graph G should be connected.Kruskal's algorithm can solve this problem in E log E $+$ E if merge sort is used $($to sort the edges$).$O f$.$This problem can be solved using Kruskal's Algorithm.