Adraw g bgive the sequence of vertices visited using

Question

Suppose that graph G has the following adjacency lists :

1- (2,3,4)

2- (1,3,4)

3- (1,2,4)

4- (1,2,3,6)

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 using depth-first search starting a t vertex 1.

(c) Give the sequence of vertices visited using breadth-first search starting at vertex 1.