Question $2$: Depth$-$First$-$Search times for each vertex in $V$ :

Answer the following ques

independent of each other and a givouming that we do not know $E.$ Note that each of the questions below are answers, but justification may help in in one part does not apply to other parts. You do not need to justify your

$($a$)15$ List all edges that must exist.

$($b$)15$ List all possible edges of $v_4($both incoming and outgoing$),$ which, if existed, would be classified as cross edges according to this DFS run.

$($c$)15$ Assuming that there are no cycles in the graph, list all vertices that cannot possibly have the largest finishing time in any DFS run.

$($d$)15$ List all vertices that cannot be in the same strongly connected component as $v_3.$

$7$ Given that $v_6{v}_1$inE, what would be the finishing time of $v_6$ in another DFS in which $v_6.d=1?$