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.