1. Draw the undirected graph that corresponds to this adjacency matrix: 211 2. Given the following directed graph, how would you represent it with an adjacency list? 3 4 3. We've seen two ways to store graphs - adjacency matrices, and adjacency lists. For a directed graph like the one shown above, how much space do we need for each type of storage? Assuming E is the number of edges and V is the number of vertices (using big O). Adjacency matrices: Adjacency lists: 4. Based on the graph in question 2, if you use Breadth First Search (BFS) and start with 0, what is the visiting order of the vertices. 5. Based on the graph in question 2, if you use Depth First Search (DFS) and start with 0, what is the visiting order of the vertices.