$($a$)$

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

so that the resulting

tree and

tree are the same and the edges are added to the tree in the same order. Assume that for both

and

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

$.$