3 t G (V, E) be a weighted simple connected graph, and asstu that all edge weights are distinct and positive. A bottleneck spanning tree G whose largest edge weight is tree of T of G is a spanning a spanning tree T of G such that T is a bottleneck spanning tree spanning tree of G is a Iimm over all spanning trees of G. Construct an example but not a minimum spanning tree of G. Show that any minimum pnn bottleneck spanning tree