Use Kruskal's algorithm for the minimum spanning tree on the following graph. (Show the initial components eg. priority queue and for each edge considered by the algorithm, show whether the edge is added to the MST or not using the union/disjoint set method, and show the MST at the end.) 12 B A 7 10 6 C 3 E D 1 8 00 11 G 2 5 F H