10. Minimum Spanning Trees. Consider the following undirected, weighted graph G 4 14 10 (a) Find the minimum spanning tree (MST) of G. Clearly list all the edges in the order in which they are discovered by your algorithm. What is the weight of the MST? 14 Marks Edge Label |Weight Total Weight | In the table above, an edge label is the pair of end points of that edge. (b) Suppose that you are asked to compute the Mazimum Weight Spanning Tree, the spanning tree with the maximum weight. However, you are not allowed to modify Kruskal's or Prim's algorithm in any way. How will you modify the input graph so that you can compute the maximum weight spanning tree using Kruskal's or Prim's algorithm. [1 Mark