1 A 2 3 cou D E 2 5 2 3 F 3 5 H Figure 1 a. Find the minimum spanning tree using the Kruskal algorithm for the graphs in Figure 1. Show all steps. (10 Marks) b. Based on your answer in (a), could you provide another minimum spanning tree using Kruskal algorithm that produce optimal solution? Explain your argument. (5 Marks) C. Prove that if a connected graph has edge weights that are all distinct (in other words, no two edges have the same weight), there is only one minimum spanning tree either with Kruskal or Prim algorithm. (10 Marks)