(Solved): XII. (12 pts) Apply Kruskal's Algorithm to the following graph to determine a Minimum Spanning Tre ...

XII. (12 pts) Apply Kruskal's Algorithm to the following graph to determine a Minimum Spanning Tree. A SHOW YOUR WORK AS YOU APPLY KRUSKAL'S ALGORITHM. THAT IS, LIST THE EDGES IN THE ORDER THAT THEY ARE ADDED TO THE TREE. WHAT IS THE COST OF THE MINIMAL SPANNING TREE? INDICATE BELOW (DRAW) THE RESULTING MINIMAL SPANNING TREE. 12 2 B 3 22 16 14 G TRACE: List below the edges Of the graph in the order in which They were added to the MST 17 15 H 10 || 8 16 4 ? E H In the space below draw the resulting MST -OR- clearly indicate the MST in the graph above