Perform a dfs on the following undirected graph G $=($V$,$ E$)$ starting at vertex A; use

the ordering given in the adjacency list representing E$.$

Push neighbors onto the stack in reverse order.

V $=\{1,2,3,4,5,6,7,8,9,10\}$