Traverse "by hand" on paper for the following graph using the depthFirstTraversal OR the breadthFirstTraversal algorithms (defined below) for the adjacency(edge) list represented below, where "visiting" is displaying the vertex number. Please indicate which traversal you used . Show each step of the traversal.

Adjacency (edge) list:

USE ONE OF THESE ALGORITHMS FOR this question DEPTH FIRST SEARCH TRAVERAL ALGORITHM: DFS(G,v): label v as visited for all edges from v to w in G.adjacentEdges(v) do if vertex w is not labeled as discovered then recursively call DFS(G,w) end if end for

BREADTH FIRST SEARCH TRAVERAL ALGORITHM: BFS(G,v) : let Q be a queue Q.enqueue(v) label v as visited while Q is not empty v = Q.dequeue() for all edges from v to w in G.adjacentEdges(v) do if w is not labeled as visited Q.enqueue(w) label w as visited end for end while

2 4 5 6 7