Consider the following undirected, weighted graph G. (a) Compute the minimum spanning tree (MST) of G. Clearly list all the edges in the order in which they are discovered by your algorithm. In the table above, an edge label is the pair of end points of that edge (b) Describe the cut property that is used to give a proof of correctness of all the algorithms for computing Minimum Spanning Trees