(algorithim design)

Draw a connected graph with six vertices, and using linked list give the adjacency lists of the graph. Label the vertices with integers, {1, 2, 3, 4, 5, 6}.

Give the order of the vertices of the graph in part (a) visited using Breadth First Search (BFS) starting at vertex 1. A queue can be used in BFS traversal. You should give the elements of the queue after every step.

Give the order of the vertices of the graph in part (a) visited using Depth First Search (DFS) starting at vertex 1. A stack can be used in DFS traversal. You should give the elements of the stack after every step