Consider the following graph:

If a depth$-$first search was performed starting from vertex $3$ to find a path to vertex $8,$ what path would be obtained?

Note: Assume that if a vertex has multiple neighbours, the DFS visits lower$-$numbered neighbours first.

Enter your answer as a sequence of space$-$separated vertex numbers. For example, if you think the answer is $\backslash (3->4->5\backslash ),$ then you should enter

$345$

Your path should include the start and end vertices $(3$ and $8).$