Consider a simple undirected weighted graph , all of whose edge weights are distinct. Which of the following statements about the minimum spanning trees of is/are TRUE?
- AThe edge with the second smallest weight is always part of any minimum spanning tree of .
- BOne or both of the edges with the third smallest and the fourth smallest weights are part of any minimum spanning tree of .
- CSuppose be such that and . Consider the edge with the minimum weight such that one of its vertices is in and the other in . Such an edge will always be part of any minimum spanning tree of .
- Dcan have multiple minimum spanning trees.

