yes, please answer the questions

Problem 2 In the same tree search problem, suppose that we have selected a heuristic given by the following table. Sate ABCDEFGHIK Heuristic 5 4 24110111 a) Is this an admissible heuristic? Why or why not? b) Using Uniform Cost Search (UCS) algorithm, write the ordered in which the nodes are expanded in addition to the value of the expansion criterion (e.g., cost) used to decide which node to expand. (Use alphabetical order to break ties). Also write the search solution reached by this al Order of mode Value of expansion criteri Order of de Value of expansion expansin criter 1 A Start state 2 B 1 3 D 2 4 F 2 5 6 Search solution. A c) Repeat (b) for Greedy search. Order nede pamia Order of die espansion Value of expansion criterion 1 2 3 4 5 6 Value of espansion criterion Start state 4 2 2 D F Search solution: A # Order of node expansion Value of expansion criterion d) Repeat (b) for A* search. Order of node Value of expansion expansion criterion 1 A Start state 2 B 1 3 D 2 4 F 2 5 6 Search solution: A LIST-Holul 12 e) Is the following an admissible heuristic? Why or why not? Sate ABCDEFGHIK Heuristic 5 4 2 5110221