Which goal node is found (first) by searching according to Depth First Search? Which goal node is found (first) by searching according to Breadth First Search? (3). (4 pts) Which goal node is found (first) by searching according to Iterative Deepening? Specify the order in which the nodes are visited. Answer: (4). (4 pts) Which goal node is found (first) by searching according to Best First Search using h?. Specify the order in which the nodes are visited. Answer: (5). (5 pts) Which goal node is found (first) by searching according to A* using hi? Specify the order in which the nodes are visited. Answer: (6). (2 pts) Which goal node is found (first) by searching according to Best-First search using h?__. You do not need to describe the order in which the nodes are visited. (7). (2 pts) Which goal node is found (first) by searching according to A* using h?. You do not need to describe the order in which the nodes are visited. (8). (2 pts) Which goal node is found (first) by searching according to Best-First search using h3? You do not need to describe the order in which the nodes are visited. (9). (2 pts) Which goal node is found (first) by searching according to A* using h3? You do not need to describe the order in which the nodes are visited. Information 3. L6 3-3 n 1 2 3 4 LA 5 6 7 8 L5 L2 L3 L7 h(n) 3 3 1 1 3 1 L8 0 3 Lg L10 L n 9 10 11 12 13 14 15 16 L11 L12 h3(n)= = L13 L14 h(n) 1 0 2 4 2 0 4 2 L17 L18 All leaves in the above tree are goal nodes in a search task. For each node, n, the following table lists hi(n), a heuristic of the distance from node n to the nearest goal node. For example, hi(2) = 3, h2(2) 1003, h3(2) = 0:003. Please answer the following questions: L19 n 17 18 19 20 L15 21 22 23 L16 0000 L20 0 2 L21 1 1 0 L22 L23 hi(n) 2 1 The Heuristics h2(n), h3(n) are created according to the following formulas: h (n) h (n) + 1000 h (n) 1000