Do algorithm tracing on the graph for the start vertex 8, and show the tracing output. The tracing output should include the sequence of recursive calls and returns from 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).

Depth-first search tree DFS (u): Mark u as "Explored" and add u to T For each edge (u, v) incident to u If v is not marked "Explored" then Recursively invoke DFS (V) Endif Endfor 1 2 16 2. 1 4 5 lulloll wll wl 3 1 5 8. 3 4 2 | 4 8 5 2 3 4 6 POD 6 7 3 8 8 3 7