3. Suppose that graph G has the following adjacency lists: 12,3,4) 5- (6,7,8) 6 (4,5,7) 7- (5,6,8) 8 5,7) (a) Draw G (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