Let be any connected undirected edge-weighted graph. The weights of the edges in are positive and distinct. Consider the following statements:
I. Minimum Spanning Tree of is always unique.
II. Shortest path between any two vertices of is always unique.
Which of the above statements is/are necessarily true?
- AI only
- BII only
- CBoth I and II
- DNeither I nor II

