A directed graph $G$ is shown in the below figure. 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.

Q$1\mathrm{.}1$

$2$ Points

Enter the discovery times of selected vertices computed by the DFS$.$

After the DFS on G$,$ the discovery times for vertices B$,$D$,$H are

B$.$d $=$

Q$1\mathrm{.}2$

$2$ Points

D$.$d $=$

Q$1\mathrm{.}3$

$2$ Points

H$.$d $=$

please i need a good explaniation to this question with drowing for better understanding $!!!$:$/$