ANSWER ALL

8. Consider the following graph: Starting from state A, execute DFS. The goal node is G. Show the order in which the nodes are expanded. Assume that the alphabetically smaller node is expanded first to break ties. 9. Suppose you have this search space: a. Draw a well labeled search tree for the search space. b. Assume that the initial state is A, and the goal state is G. Show how each of the following search strategies would create a search tree to find a path from the initial state to the goal state: i. Breadth first search ii. Depth first search iii. Uniform cost search iv. Iterative deepening search At each step of the search algorithm, show which node is being expanded, and the content of the fringe. Also report the eventual solution found by each algorithm, and the solution cost