Problem $5-3()$

$5$ points

$($a$)(5$ points$)$ A graph has a unique minimum spanning tree if$,$ for every cut of the graph,

there is a unique light edge crossing the cut. Show that the converse is not true by giving a

counterexample. An edge is a light edge crossing a cut if its weight is the minimum of any

edge crossing the cut.