1. Prove by induction that a graph with n vertices has at most n(n-1)/2 edges. 2 10 12 5 2 1 A 6. 8. 3 E 3. 3 4 11 10 2. For the undirected weighted graphs shown above: a. Represent the graphs using...

Extracted text: 1. Prove by induction that a graph with n vertices has at most n(n-1)/2 edges. 2 10 12 5 2 1 A 6. 8. 3 E 3. 3 4 11 10 2. For the undirected weighted graphs shown above: a. Represent the graphs using the adjacency matrix representation b. Represent the graphs using the adjacency list representation. If a pointer requires four bytes, a vertex label requires two bytes, and an edge weight requires two С. bytes, which representation requires more space for each graph? B.