We consider the minimum spanning tree problem for a given undirected connected weighted graph G (V, E) with cost function c: E-R+ on the edges (a) State the cut property for the computation of minimum spanning trees. (b) Give Jarnk-Prim's algorithm for computing a minimum spanning tree and analyze its runtime (c) Compute a minimum spanning of the following graph by using Kruskal's algorithm. Show the status of your partial minimum spanning tree af ter each edge insertion. 10 10 4 10 (d) Is there a unique minimum spanning tree for this graph? If so, explain why. If not, give two different minimum spanning trees