This question is based on the cut lemma for minimum spanning trees. Let G = (V, E) be a connected graph where each edge has a positive weight. If for any cut of G, there e cut of minimum wei en show that minimum tree of G is unique. Show that the converse may not be true using an example. Le. construct a graph G that has a unique minimum spanning tree, but there are cut(s) in G containing multiple edges having the minimum weight. This question is based on the cut lemma for minimum spanning trees. Let G = (V, E) be a connected graph where each edge has a positive weight. If for any cut of G, there e cut of minimum wei en show that minimum tree of G is unique. Show that the converse may not be true using an example. Le. construct a graph G that has a unique minimum spanning tree, but there are cut(s) in G containing multiple edges having the minimum weight