3. Suppose that graph G has the following adjacency lists: (a) Draw G. 1 2 (2,3,4) (1, 3, 4) 3 4 5 6 - - - (1,2,4) (1,2,3,6) (6,7,8) (4,5,7) 7 - (5,6,8) 8 - (5,7) (b) Give the sequence of vertices visited by depth-first search starting at vertex 1. (c) Give the sequence of vertices visited by breadth-first search starting at vertex 1. (15 pts.)