Draw a simple undirected graph g that has 10 vertices and

Question

Need help with this assignment.

Part 1:

1. Draw a simple undirected graph G that has 10 vertices and 15 edges.
2. Draw an adjacency list and adjacency matrix representation of the undirected graph in question 1.
3. Write a short paragraph to describe the graph you draw.

Part 2:

1. Use big O notation to explain the complexity and performance of the following data structures:  Arrays, linked list, and vector
2. Use big O notation to explain the complexity and performance of the following data structures:  Stacks and Queues