Let G be an undirected graph in which edges (u, v) have weights wu,v, and let T be a spanning tree with maximum total edge weight. Let (a, b) be an edge in T. Show that every other spanning tree in G has some edge whose weight is wab.

Problem 2 (10 points) Let G be an undirected graph in which edges (u, v) have weights wuv, and let T be a spanning tree with maximum total edge weight. Let (a, b) be an edge in T. Show that every other spanning tree in G has some edge whose weight is