3. [8%] Consider the following graph: H E 1) Write down the adjacency matrix and adjacency lists specifying this graph. (2) Starting at vertex A and resolving ties by the vertex alphabetical order, traverse the graph by depth-first search and construct the corresponding DFS stack and depth-first search tree.