Question $2$

We consider the same graph and adjacency list as in question $1$:

If we perform depth$-$first search on this graph starting from vertex $0,$ in what order to the calls to depth$-$first search on a vertex finish?