This is an Algorithms question. Thank you.

Suppose that graph G has the following adjacency lists: 1 - (4: 2) 2 - (5;3) 3 - (6;4) 4 - (7: 5) 5 - (1;6) 6 - (2: 7) 7 - (3: 1) (a) Draw G if the graph is directed and the adjacency list is interpreted as ordered (b) Give the equivalent adjacency matrix representation for directed graph G (c) Draw G if the graph is undirected and the adjacency list is interpreted as unordered (d) Give the sequence of vertices visited using depth-first search on the undirected graph starting at vertex 1 (neighbors are visited in numerical order) (e) Give the sequence of vertices visited using breadth-first search on the undirected graph starting at vertex 1 (neighbors are visited in numerical order)