Consider the following statements:
- Let T be a minimum spanning tree of a graph G. Then for any two vertices u and v the path from u to v in T is the shortest path from u to v in the graph G
- Suppose that average edge weight for a graph G is $A_{avg}$. Then the minimum spanning tree of G will have weight at most (n-1) $A_{avg}$. Where n is number of vertices in graph G.
Which of the above statements are true?
- Only I
- Only II
- both I and II
- None of these
plz give one one counter example of both option I & II