This question is based on the graph given on the right side.

Simulate traversal of all vertices starting at node $\text{'}$A$\text{'}$ using Depth

First Search $($DFS$).$ Use alphabetical order $($ascending$)$ to break

ties. You need to write the sequence of nodes in the above

traversal.

Show the state of your auxiliary data structures $($e$.$g$.,$

stack$/$queue$)$ at each step.

Write down the memory representation of the above graph using both Array Matrix and

Adjacency List.