Trace the execution of a Depth First Search given the graphabove as input.
Draw the state of the graph above at the start and end of eachDFS call on a given vertex.
——————————————————————————————-
Maintain the call stack alongside your diagrams.(Optional butRecommended)
*At the start of the call is before anything is executed(beforethe vertex is marked).
*At the end is just after all lines of the function haveexecuted and the call would terminate.
Solution
DFS: Depth First Search: It goes asdeep as possible and backtracks till all the vertices arevisited
Slack 丁