Problem
1. Write a program to generate random complete weighted graphs with V vertices by simply filling in an adjacency matrix with random numbers between I and V. Run empirical tests to determine which method finds the minimum spanning tree faster for V = 10, 25, 100: Prim's or Kruskal's.
2. Give a counterexample to show why the following method for finding the Euclidean minimum spanning tree doesn't work: "Sort the points on their x coordinates, then find the minimum spanning trees of the first half and the second half, then find the shortest edge that connects them."