Question 3 (6 points) For the graph shown below, apply Kruskal's algorithm to find the minimum spanning tree. Use the following table to list the edges and process them one-by-one. For each edge, follow the alphabetical order for the two end points, e.g., use (A,B) and not (B,A). If two edges have the same weight, order them alphabetically using the first, then second end point, e.g., (A,B) comes before (A,C) and (A,C) comes before (B,C). At the end, provide the final MST. Edge(u, v) w(u, v) Action 12 10 18 B 3 4 8 2 15 D 20 5 22 F 8 22 3 D F 2 G (Use the following graph to draw the final MST)