Hi, I was wondering if you could help me with my problem set for my intro to algorithms course. This problem is dealing with minimum WIDTH spanning trees.

Thank you

Let G -(V, E, W) be a weighted connected (undirected) graph, where V is the set of vertices, E is the set of edges, we E W for each e E is a nonnegative weight of the edge e. A spanning tree is defined as usual, namely T-(V,TE) where TE C E and T is a tree. The width of a spanning tree T is maxfwe | e E TE Thus it is the most "expensive" edge in the tree. T is a Minimum width spanning tree of G if it is a spanning tree and achieves the minimum width among all spanning trees of G Show that even if the weights of G (V, E, W) are all distinct, there could be more than one Minimum width spanning trees. Suppose Est = {e E E | we