(1). Which goal node is found (first) by searching according to Depth First Search? ________

(2). Which goal node is found (first) by searching according to Breadth First Search? ________

(3). Which goal node is found (first) by searching according to Iterative Deepening? ________ Specify the order in which the nodes are visited. Answer:

(4). Which goal node is found (first) by searching according to Best First Search using h1? ________. Specify the order in which the nodes are visited. Answer:

(5). Which goal node is found (first) by searching according to A using h1? ________ Specify the order in which the nodes are visited. Answer:

(6). Which goal node is found (first) by searching according to Best-First search using h2? ________. You do not need to describe the order in which the nodes are visited.

(7). Which goal node is found (first) by searching according to A using h2? ________. You do not need to describe the order in which the nodes are visited.

(8). 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). 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.

115 L16 L20 L21 L10 L22 L23 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. hi(n) hi(n) 17 3 11 hin) 10 19 13 22 14 15 16 8 2 23 1 8 2 The Heuristics ha(n), h3(n) are created according to the following formulas: h2(n) = h (n) + 1000 hin) h(n) = 1000 For example, h (2) = 3, h2(2) = 1003, h3(2) = 0:003. Please answer the following questions