Depth$-$first search

Consider a DFS $($Depth$-$First Search$)$ of the graph below starting from node a$.$ Assume that in the DFS call for that node, the

neighbors of the node are processed in alphabetical order.

For the following two sets of questions, you need to determine the label for each edge $--$ tree, forward, back, or cross $--$ and the

discovery and finish times for each node. Then, answer the questions below.

Question $3$

Edge labels

For each of the the following, enter an answer from $\{$tree$,$ forward, back, cross$\}$

Label for edge $(f,d)$

Label for edge $($c$,$f$)$:

Label for edge $($d$,$b$)$: