Find the minimum cost spanning tree on the graph above using Kruskal's algorithm. Draw the edges included in the minimum cost spanning tree on the graph below.

Important Note: You may have difficulty drawing multiple edges to a vertex. When that happens, draw a line segment to a location near the vertex, and then drag it to the desired vertex to make the connection.

Clear All Draw:

What is the total weight of the minimum weight spanning tree?