$9\mathrm{.}4\mathrm{.}1$: BFS and DFS trees for a small graph.

$lon$

$1$

$($a$)$ Give the tree resulting from a traversal of the graph below starting at vertex $a$

using BFS and DFS$.$ Assume that the neighbors of a vertex are considered in

alphabetical order.