An undirected 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 DFS is completed$).$

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

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

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

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

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

$($f$)$ What is the value of I.$\backslash$pi $?$

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

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

$($i$)$ What is the value of J$.\backslash$pi $?$

MAKE SURE TO PLEASE SOLVE QUESTION FROM $($a to i$)$