Quiz: DFS Traversal Order

You run DFS from vertex $0$ on an adjacency list where neighbors are stored in ascending order. The edges are: $0$-$1$, $0$-$3$, $1$-$2$, $3$-$2$. Which vertex does DFS visit last?

1. A.$0$
2. B.$1$
3. C.$2$
4. D.$3$