with appropriate numerical illustration w.r.t to the given problem. Provide the heuristic value associated with each state. 101 H1: Number of Misplaced Colored Tiles, water bowl and paint brush w.r.t to the goal state. H2: Sum of Manhattan distances of all the misplaced tiles w.r.t to the goal state 26-2023/ 23/01 c. Apply Recursive best first search algorithm for the search tree obtained from part a and using best heuristic selected under part b, only till first 5 closed list updates or till no more nodes are left. Show the Latus of OPEN and CLOSE list at each level