32. For the graph below, use Kruskal's algorithm to find the Minimum Spanning tree The number on each edge denotes its weight, and the letter is a unique label you should use in your answer to specify that edge. Provide the edges in the order in which they would be found by Kruskal's algorithm. Break any ties using the alphabetical label. Give your answer in terms of the alphabetical labels, e.g. if Kruskal's algorithm adds the edge between vertices 3 and 4, you would write H for that edge A: 1 D:2 E:3 C:1 B:4 F:4 4 H:5 3 G:1