1. Minimum Spanning Trees Draw the minimum spanning tree that results when running Kruskal's algorithm on the graph below. Please draw the vertices in the same order as in the graph below. Write final state of the array disjoint sets data structure from the run that results from using union-by-SIZE with NO path compression. If there is a tie between edges in Kruskal's algorithm, choose the edge for which the endpoints, when written in alphabetical order, are alphabetically first. For example, if (D, A) and (B, C) were tied, you would chose (D,A) first because "AD" is alphabetically before "BC". If two trees to be unioned have the same size, make the root of the unioned tree the representative element that comes alphabetically first. For example, if a tree rooted at A and a tree rooted at F are to be unioned but have the same size, then A would be used as the root of the combined tree. When drawing the final array, assume that the mapping from vertex letter to array index is alphabetical: A -0, B-1, etc 2 2 13 3