answre b and c and please dont send me the answre on the bottom again and again

Problem 2 In the same tree search problem, suppose that we have selected a heuristic given by the following table. Sate ABCDEF Heuristic 54 2 G H 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...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 node expansion Value of expansion criterion 1 2 3 Order of node expansion A B D F Value of expansion criterion Start state 1 2 2 7 8 9 10 11 12 4 5 6 Search solution: A Order of node expansion Value of expansion criterion Repeat (b) for Greedy search. Order of node Value of expansion expansion criterion 1 A Start state 2 B 4 3 D 2 4 F 2 5 6 Search solution: A 7 8 19 10 11 12 EXPLANATION:- Shale: ABCDEFGHITA Merisie: 5724110 @ Ragnhin 15 A 40 a fogth 375 Houston 2.45 A-for-4133 60- Innlein 5+126 6.1.11 Atom) = fathew=6+1=7 ADEX onih IS A- 1-5+6)--gemakin 10-2 * H-3 mi - in km1+1:00 +0 Total coal of gobels: 7 monnike che tout for the hewnatie admissible HIND SH6) [6] DEFGHIK 4 9. I lot A 1 an so this in admissible heuristic -(e) stote: A B C D E F G H IK. Henke: 5 4 3 5 22 A. Fon) - inhin) 1145 then 3t 5 A B -> fon 01) hon2+527 A B Fton) - hithen) + 2+1=3 A B -E, Rom - ginekoma 5+=6 A6 EK 7+1-8 A ?) 300)