Let G = (V, E) be any connected undirected edge-weighted graph. The weights of the edges in E are positive any distinct. Consider the following statements:I. Minimum Spanning Tree of G is always unique.II. Shortest path between any two vertices of G is always unique.Which of the above statements is/are necessarily true?

Let G = (V, E) be any connected undirected edge-weighted graph. The we

1.	Let G = (V, E) be any connected undirected edge-weighted graph. The weights of the edges in E are positive any distinct. Consider the following statements:I. Minimum Spanning Tree of G is always unique.II. Shortest path between any two vertices of G is always unique.Which of the above statements is/are necessarily true?
A.	I only
B.	II only
C.	both I and II
D.	neither I and II
Answer» B. II only