1. 6 6 Apply Kruskal's algorithm to find the minimum spanning tree. Use makeset (x), find(x), and union(x, y) to determine if there are cycles. Using the forest representation of subsets taught in class, show the tree after all edges have been processed. When processing edges, make sure lower letters appear first. (i.e. use AB, not BA) When drawing the tree, put lower letters in left subtrees so that all the vertices in alevel are sorted alphabetically from left to right. a, Edges in MST: b, Weight of MST: cFinal tree resulting from union-find algorithm