Question $2$

Say that we do depth$-$first search on this graph starting from vertex $0.$ the graph is in the photo

We visit neighbours in the order in which they appear in this adjacency list

Which of the following gives the postorder sequence from this traversal, i$.$e$.,$ is a list of the vertices in order of the

time that the call to depth$-$first search on the vertices finishes. which is the correct answer below?

$-2,5,4,3,1,0$

$-5,4,3,2,1,0$

$-0,1,3,4,2,5$

$-$This graph does not have a postorder sequence because it has a directed cycle.