5. Suppose you have an undirected graph G(V, E), with associated edge weights w(ei), where the set of edges E -[ei,e2,...,em] (each ei -(u, v), where nodes u and v are the endpoints of edge e in E). Assume that w(e)i, for all 1im, and that the set of n 1 edges e1,.. ,en-1 form a spanning tree of G. Show that, in this case, G has a unique MST (you have to provide a brief justification for this fact). Give an example of such a graph G and its MST Hint: First note that w(e)