Problem 9 (10 Points) Minimum spanning trees are used in many applications. Consider a con- nected graph G with edges that are labeled by positive weights. Show that if all edges have different weights, then the minimum spanning tree of G is unique. Complete this proof: Seeking a contradiction, we assume that G has two different minimum spanning trees M and M