In this single player game, the Pacman Agrat aims to efficieatly reach the "Exir" in the shortest way possible, after eatiag arleat oae Red food pellet and one Creea food pellet (thougli Pactass mary eat more fles cor of each food pellets in its path). Pacman has four actions: moveliorti., movefond mevelifit, or moveliast and it does not have a "stay" action. Each action incurs s ceet of +2 fer the agrat. ta adfitioa to this, if aa ageat eats a red a. Depict the search tree for ap to ecactly three levels ie., level 3. (Oiven initial state can a. Depict the search tree for up to exactly three levels ie, 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 rach atate and check the admissibility and consistency for any three generated states. Heuristies is given by, H()=2 (Manhattan distance (Pacmanugent, Exif)) c. Implement the A algorithm only for the first 4 closed list updates. Show the status of OPEN and CLOSE list at each level. It this single player game, the Pacmast Ageat aims to efficiently reach the "Exit" in the shortest way possible, after eating atlenst one Res food pellet aod one Creen food pellet (thougi Pacman may eat more than ose of each food pellets in its path). Pacman has four metions: moveNorth. moveSouth, moveWest, or moveFast and it does not have a "stay" action. Lach action incurs a cost of +2 for the sprat. Is abfirioa to this, if an ageat eats a red pellet and green pellet it incurs s cost of 45 mat +3 repertively. ta below fixed board configuration of dimension N+M, there are 3 ind pellets sat 6 green pellets. A. Depiet the search tree for up to enactly three levels le., level 3. (Given initial state can be assumed to be on level-0.) with calculaned gart cost sbown in the diagnam neatly b. Compute the heuristic value for each itute asi elarek the admissibilify and consistency for any three graensted states. Aruriatics is given by. M(m)=2 (Mamhatian distaxt intmantgeat Loit) c. Implement the A algorithm owly fio far fert a choced list updates. Show the status of OPIN and Ct.OSI list at each levi