Question 1 ERARDO In the above search problem the goal is to compute a path from S to G. 1. What is the value of the shortest path from each node to the goal node G. Answer: nd(n) QUOU> 2. There are 6 edges in the graph. For each edge, if it is directed from node X to node Y compute the difference (X)- (Y). Answer: XY (X) - A(Y) 3. Is h(n) admissible? YES / NO 4. Is h(n) consistent? YES / NO 5. Run A" on this problem. In what order are the nodes visited? Answer: b. What path from S to G is found by the algorithm? Auswer: 6. Run the version of A' where closed nodes are not revisited In what order are the nodes visited? Answer: b. What path from S to G is found by the algorithm Answers Question 2 Consider the search tree below. The initial state is at the top, and the goal states are G and I, represented by the double-bordered rectangles. (Note that this is a search tree. The edges are directed.) |A, h=3 C, h=3 D, h=10 F, b=0 G, ho HD-2 Part 1 For each of the search strategies listed below, give a chronologically ordered list of the nodes visited (including the final goal node) Breadth-first search Depth-first search Iterative-deepening search Best-first search A search IDA search Part II Is the seara liste wed in the problem above d e Explain your YES / NO. Because b. lethed rated in the problem above com p lain your YES / NO. Because To h=1 12 li=1 h=0 114 h=1 ho h=1 h=0 10 7211 b=0 24 ES In the above search tree all leaves are goal nodes. The value of his a heuristic estimate to the distance from a node to the nearest goal node. In the following questions, if there are multiple paths and goal modes that are correct answers, you are asked to choose ONE Which goal node is found by searching according to Iterative-Deepening? Answer: The goal node found by Iterative-Deepening is: - Which goal node is found by searching according to IDA*? Describe the order in which the nodes are visited. Answers The goal node found by IDA is: . The order