Question $1(1$ mark$)$

Consider the following graph:

If we ran a breadth$-$first search starting from vertex $0$ to find a path to vertex $8,$ what path would we get?

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

$($a$)$

$0-3-5-8$

$($b$)$

$0-3-4-5-8$

$($c$)$

$0-2-6-7-8$

$($d$)$

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

$($e$)$

None of the above are correct