dplease give 3-7. depth first GRAPH search

Consider the following directed graph for the following questions: Let A be the initial state and H is the goal state. List the first few vertices expanded by a Depth-first GRAPH search (enter the single letter label of a node): 1. A 2. C 3. 4. 5. 6. 7. Note: - You must use the algorithm shown in class and in the PPT. - A node is "expanded" when it is taken out of the frontier and its children are inserted - Child states of a state are generated in alphabetical order