DO NOT COPY FROM OTHER ANSWERS, THEY ARE WRONG!!

Consider the following directed grabh for the following auestions: Let A be the initial state and H is the goal state. List the first few vertices expanded by a Depthfirst TREE search with loop checking (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. Loop checking only tests if the current node is on the path from the initial node to current node. 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