A directed graph $G$ is shown in the figure below.

Assume that the adjacency lists are in alphabetical order. Apply depth$-$first search $($DFS$)$ on

graph G$.$ In the main loop of DFS$,$ check the vertices in alphabetical order.

Answer the following questions $($after the DFS is completed$)$:

$($a$)$ What is the value of B$.$f$?$

$($b$)$ What is the value of C$.$f$?$

$($c$)$ What is the value of D$.$f$?$

$($d$)$ What is the value of H$.$d$?$

$($e$)$ What is the value of I.d$?$

$($f$)$ What is the value of J$.$d$?$

$($g$)$ What is the value of C$.?$

$($h$)$ What is the value of D$.?$

$($i$)$ What is the value of F$.?$