Q$4\mathrm{.}3$ BFS

$7$ Points

Now ignore the directions and assume this graph is undirected. Carry out a bridth$-$first search of

the given $($undirected$)$ graph, without a goal node, using a closed list, starting from node $5.$

Show the evolution of the queu. $($all the steps$).$

Draw the resulting BFS tree.

Indicate the type of each edge.

Explore neighbors of a node in ascending order $($if $3$ and $4$ have the same priority you need to

discover $3$ first$).$