Figure $14\mathrm{.}42$: The graph in Exercise $16,$ For the graph in Figure $14\mathrm{.}42$ give two spanning trees: one that is constructed using depth$-$first search starting in p and visiting neighbors in alphabetical order $($q before r before s before t$,...),$ and one that is constructed using breadth$-$first search starting in p and visiting neighbors in alphabetical order.