$9\mathrm{.}4\mathrm{.}2$: When are a BFS tree and a DFS tree the same?

$($a$)$ Give an example of a graph with five vertices along with a labeling of the

vertices $(a,b,c,d,e)$ so that the resulting BFS tree and DFS tree are the same and the

edges are added to the tree in the same order. Assume that for both BFS and DFS$,$

the neighbors of a vertex are considered in alphabetical order and both start at

vertex $a.$