Consider a undirected graph G with vertices { A, B, C, D, E}. In graph G, every edge has distinct weight. Edge CD is edge with minimum weight and edge AB is edge with maximum weight. Then, which of the following is false?

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