Question 3 All leaves in the above tree are goal nodes in a search task. For each node, n, the following table lists (n.), la(n), two houristic estimates of the distance from nodon to the nearest goul node. | (n) | La(n) | In | 11(n) | a(n). n | ht(n) | ha(n) | 122 9 2 1 17 31 2 2 1000 18 12 31 11 16 1900 431 1243 2016 541 211 22 1 1 23 00 42 10 0 a. 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? b. Which goal node is found (first) by searching according to Best First Searcb, using his thie, heuristic estimate to the distance to the nearest goal node? Describe the order in which the nodes are visited. Answer: The goal node found (first) by Best First Search is: . The order: c. Which goal node is found (first) by scarching according to A', usins bs as the heuristic estimate to the distance to the nearest goal node? Describe the order by which the nodes are visited. Answer: The goal node found (first) by A* is: - . The order