$2(16$ pts$)$ 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\}$

$E\{1\}=[2,7]$

$E\{2\}=[2,3,4]$

$E\{3\}=[2,4]$

$E\{4\}=[2,3]$

$E\{5\}=[6,8]$

$E\{6\}=[5,7]$

$E\{7\}=[1,6]$

$E\{8\}=[5,9,10]$

$E\{9\}=[8,10]$

$E\{10\}=[8,9]$