Kruskal's algorithm Find a minimum spanning tree of the graph G1 in Figure 1 using Kruskal's algorithm and the array-and-linked-list data structure, together with the weighted union heuristic. You should write down the edge considered at each step (including those not added to the minimum spanning tree) and you should also draw the graph with the edge added after each step (similar to the example in the relevant lecture slides and recorded lecture). 2 5 6 7 14 G