A directed graph $G$ is shown below. Assume we are using adjacency lists as the graph representation. We further assume that the vertices on the adjacency lists are listed

Apply depth$-$first search $($DFS$)$ on the graph. In the main$-$loop of DFS$,$ check the vertices in alphabetical order. During the computation, the algorithm computes values v$.$d$,$ v$.$f$,$ and $v.$ for each vertex in the graph, where $v.d$ is the discovery time of vertex $v.f$ is the finish time of vertex $v,$ and $v.$ is the predecessor of vertex $v,$ respectively. After the DFS$,$ answer the following questions.

$($a$)$ After the DFS$,$ what is the value of C$.$d$?$

$($b$)$ After the DFS$,$ what is the value of C$.$f$?$

$($c$)$ After the DFS$,$ what is the value of C$.?$

$($d$)$ After the DFS$,$ what is the value of D$.$d$?$

$$

$($e$)$ After the DFS$,$ what is the value of D$.$f$?$

$$

$($f$)$ After the DFS$,$ what is the value of D$.?$

A directed graph $G$ is shown below. Assume we are using adjacency lists as the graph representation. We further assume that the vertices on the adjacency lists are listed

Apply depth$-$first search $($DFS$)$ on the graph. In the main$-$loop of DFS$,$ check the vertices in alphabetical order. During the computation, the algorithm computes values v$.$d$,$ v$.$f$,$ and v$.$ for each vertex in the graph, where $v.d$ is the discovery time of vertex $v.f$ is the finish time of vertex $v,$ and $v.$ is the predecessor of vertex $v,$ respectively. After the DFS$,$ answer the following questions. PART a$-$f

$$