(Quiz week 4, sep 8th) Consider the Network defined bellow.

Starting from node 0, perform the BFS Algorithm proceeding in increasing order (labels of the nodes) throught the network. Then, choose which of the queues bellow corresponds to the correct visiting order:

1. ($0$ $\rightarrow$ $1$ $\rightarrow$ $11$ $\rightarrow$ $12$ $\rightarrow$ $8$ $\rightarrow$ $10$ $\rightarrow$ $2$ $\rightarrow$ $7$ $\rightarrow$ $9$ $\rightarrow$ $3$ $\rightarrow$ $4$ $\rightarrow$ $6$ $\rightarrow$ $5$)
2. ($0$ $\rightarrow$ $1$ $\rightarrow$ $11$ $\rightarrow$ $12$ $\rightarrow$ $8$ $\rightarrow$ $10$ $\rightarrow$ $2$ $\rightarrow$ $3$ $\rightarrow$ $5$ $\rightarrow$ $4$ $\rightarrow$ $6$ $\rightarrow$ $7$ $\rightarrow$ $9$)
3. ($0$ $\rightarrow$ $1$ $\rightarrow$ $12$ $\rightarrow$ $11$ $\rightarrow$ $8$ $\rightarrow$ $10$ $\rightarrow$ $2$ $\rightarrow$ $3$ $\rightarrow$ $5$ $\rightarrow$ $4$ $\rightarrow$ $6$ $\rightarrow$ $7$ $\rightarrow$ $9$)
4. ($0$ $\rightarrow$ $1$ $\rightarrow$ $11$ $\rightarrow$ $12$ $\rightarrow$ $8$ $\rightarrow$ $10$ $\rightarrow$ $2$ $\rightarrow$ $3$ $\rightarrow$ $4$ $\rightarrow$ $5$ $\rightarrow$ $6$ $\rightarrow$ $7$ $\rightarrow$ $9$)
5. None of the above.

Original idea by: Fábio Assunção.