Apply the DFS based topological sort algorithm to the graph on the left; Your DFS traversal will start with vertext a.

Write down the nodes visited during a regular DFS traversal.

Write down the nodes popped by the stack during this traversal.

Write down the final topological order for this graph.

All bullet points are part of the same question. The more detail the better.

e g g C b b C