Q$4\mathrm{.}2$ DFS

$8$ Points

Carry out a depth$-$first search of the given directed graph, without a goal node, using a closed list,

starting from node $2.$

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

Draw the resulting DFS 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$).$