Consider the following unweighted and directed graph, with its associated adjacency list:

If we perform depth$-$first search on this

graph starting from vertex $0,$ in what

order will we first visit each of the

vertices? When at a vertex, we explore

the neighbours in the order they are

given in the adjacency list.

a$.0,1,2,3,4$

b$.0,2,4,3,1$

c$.0,1,2,4,3$

d$.1,0,2,3,4$