Question: depthfirst search algorithm tracing consider the recursive depthfirst search algorithm...
[Depth-first search: algorithm tracing] Consider the recursive depth-first search algorithm, the graph, and its adjacency list representation shown below. Consider the nodes in a linked list of the adjacency list in the order from left to right exactly as shown. Do algorithm tracing on the graph twice, once for the start vertex 2 and once for the start vertex 6, and show the tracing output. The tracing output should include the sequence of recursive calls and returnsfrom those calls in the following format: “call DFS(a); call DFS(b); call DFS(c); return from DFS(c); call DFS(d); return from DFS(d); return from DFS(b); return from DFS(a)”.Additionally, show the depth-first search tree resulting from each run of the algorithm; use the format shown in Figure 3.5(g).