Tessellate S.T.E.M.S. (2019) - Computer Science - College - Set 4 - Objective Problem 3

Let $G$ be an undirected connected graph with distinct edge weights. Let $M$ and $m$ be the edges with maximum weight and minimum weight respectively.

Which of the following statements is FALSE?

• A) Every minimum spanning tree of $G$ must contain $m$ .
• B) If $M$ is in a minimum spanning tree, then its removal must disconnect $G$ .
• C) No minimum spanning tree contains $M$
• D) $G$ has a unique minimum spanning tree.

This problem is a part of Tessellate S.T.E.M.S (2019)