Use alphabetic ordering for the order in which neighbors are visited. For example, if the choices of neighbors are A and $E,$ you would visit A first.

To write your answer, write the vertices in the traversal order separated by a single space $($e$.$g$.,$ A B C D E F G$).$ Include no other characters.

Trace a breadth$-$first traversal starting at vertex $A.$

Trace a breadth$-$first traversal starting at vertex $H.$

Trace a depth$-$first traversal starting at vertex $A.$

Trace a depth$-$first traversal starting at vertex $H.$

Trace a topological ordering. $$