4 4 Z 6 E 4 G Graph K 3 (14 pts) For the graph K use Kruskal's algorithm to find a minimum-cost spanning tree, and then determine the minimum cost. Use alphabetical ordering. Construct a hash table using the lengths of the edges to store the edges. Sort the edges in each bucket using alphabetical ordering. Construct a minimum cost spanning tree by using the edges in each bucket moving from left to right starting with bucket with the lowest value: Minimum Cost