Problem
1. Give the shortest path trees for the other nodes in the example graph.
2. Describe how you would find the minimum spanning tree of an extremely large graph (too large to fit in main memory).
3. Write a program to generate random connected graphs with V vertices, then find the minimum spanning tree and shortest path tree for some vertex. Use random weights between I and V. How do the weights of the trees compare for different values of V?