$9\mathrm{.}4\mathrm{.}3$: Labeling vertices to produce a particular BFS or DFS tree.

$($b$)$ Label the vertices of the graph given below so that if DFS is run starting at

vertex a and the neighbors are considered in alphabetical order, then the resulting

DFS tree consists of the edges shown in red.