Suppose that graph G has the following adjacency lists: 1- (2; 3:4) 5- (6; 7; 8) 6 (4:5; 7) 7 - (5; 6; 8) 8 (5; 7) 1) Draw G. 2) Give the sequence of vertices visited using depth-first search starting at vertex 1 3) Give the sequence of vertices visited using breadth-first search starting at vertex