$3.(10$ pts$)$ Consider the following graph $\backslash ($ H $\backslash ).$

$($a$)(3$ pts$)$ Write out the adjacency list representation for the graph $\backslash ($ H $\backslash ).$ At the list in each node, the vertices connected to it should be in alphabetic order $($of vertex label$).$

$($b$)(7$ pts$)$ Draw the DFS tree resulting from the recursive DFS exploration starting at vertex $\backslash ($ A $\backslash ).$