Given a connected and undirected graph below, create the minimum spanning tree (MST) using the Kruskal's Minimum Spanning Tree algorithm. Show your work by drawing all intermediate MST(s) and the final MST as you work through this problem. You can attach your drawings of the intermediate MST(S) here. 1 12 10 10 28 2 15 4 4 0 13 3 65 6