a. Depict the search tree for up to exactly three levels je., level 3. (Given initial state can be assumed to be on level-0.) with calculated path cost shown in the diagram neatly b. Compute the heuristic value for each state and check the admissibility and consistency for any three generated states. Heuristics is given by, F(n)=2( Manhattan distance (Pacmantgent, Exit)) c. Implement the A algorithm only for the first 4 closed list updates. Show the status of OPEN and CLOSE list at each level