Con$$ider the following graph:

Simulate the BFS algorithm on this graph to compute the shortest paths between $0$ and every other node. Continue until the queue is empty. Assume the edges are discovered in the order of the node labels they connect and follow the trace format shown below for your answer.

Set up: marked $[]=T$

queue $=\frac{0}{\frac{?}{?}}$ right is front

Loop $1$:

$v=$

edgeTo $[]=$

marked $[]=$

queue $=\{\}$