Homework-1 Question 1 All leaves in the above tree are goal nodes in a search task. A(n), ha(n) are two heuristic estimates for the distance of moden to the nearest goal node. n do) g(n) (w) ha(w) TIT 2 22 3 3 54 61 8 - IIIIIIIIIII - -- 100 111. 120 13 0 TO 1500 16 0 0 a. For each node n, fill in the above table the value of d(n) the distance of n from the nearest goal node, and g(n) the depth of noden. b. Which goal node is found by searching according to Depth First Search? Which goal mode is found by searching according to Breadth First Search? c. Which goal node is found by searching according to Best First Searc, using hy as the leuristic estimate to the distance from a goal node? d. Which goal node is found by searching according to A', using h, as the leuristic estimate to the distance from a goal node? e. Which gonl node is found by searching according to A', using hear the heuristic estimate to the distance from a goal node