DM.GT.4.b: Use Kruskal’s algorithm to determine the shortest spanning tree of a connected graph.