This assignment consists of two parts:

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. Based on the course reading in this module and your own research,  use big O notation to explain the complexity and performance of the  following data structures:

Arrays, linked list, and vector

1. Based on the course reading in this module and your own research,  use big O notation to explain the complexity and performance of the  following data structures:

Stacks and Queues