A bottleneck spanning tree of a weighted network G $=($V$,$ E$)$ is a tree that touches every vertex in V whose longest edge is as small as possible. Show that any minimum spanning tree is always a bottleneck spanning tree, but not vice versa.