Two Robocs, A add B competes to leave the maze thirough either of exits: E asd E2 as shown in the diagram. At each time step, each Robot nove to na adgacest free square. Robots are not allowed to enter squares that other robocs are moving inso. The same exit cannot be red by both robots at once, but either robot may use either exit. A poisonoss gns is leat behind when a robot moves. No robot may enter the poisonous square for the duration of the gas's 1-fime-step presence tie. If the sqaare is lent free for cee gane round, the poisan evaporases and is no loager daageroush. The polsonoas sqaares are represented as "s in the dilkgan. For utility calcalation consider the below assuargeions. the bosed posifion) Nete: Player " ZS " ability fo win is given by below: Lanity = Mndwan ( manhastranDatanceVPlayw "Z", Enit EJ), nawhantranDistancerPlayer "Z", Ex(t Ez) ) + Penalty Penoly = Number of tuscefe cells colockaget poisanous squares) with 4 degree of a. If Roboe ' A ' starts the play, construct game tree with uniliry up to level 3 or cone round per player and one more round by the MAX playes. b. Implemaent a MIN.MAX algonithm for the game tree constructed usder part n. 2. Depict the search tiee for up to esactly thee levels ie, level 3. (Oiveu initial state can be assaned to be cat level-6. with calculated jath cout sberun in tlee diagnea neally b. Compule tine hoseribie value for each state sud elueck the admissibility and consistency for any three generated states. Heuristics is given by, H()=2 (Mahhatran distance (Pacmastgen. Frip) c. Incplemeal the A algocithin eoly for the first 4 closed liat updates. Sbow the stanas of OPPN and CLOSE list ar ench level. Two Robocs, A add B competes to leave the maze thirough either of exits: E asd E2 as shown in the diagram. At each time step, each Robot nove to na adgacest free square. Robots are not allowed to enter squares that other robocs are moving inso. The same exit cannot be red by both robots at once, but either robot may use either exit. A poisonoss gns is leat behind when a robot moves. No robot may enter the poisonous square for the duration of the gas's 1-fime-step presence tie. If the sqaare is lent free for cee gane round, the poisan evaporases and is no loager daageroush. The polsonoas sqaares are represented as "s in the dilkgan. For utility calcalation consider the below assuargeions. the bosed posifion) Nete: Player " ZS " ability fo win is given by below: Lanity = Mndwan ( manhastranDatanceVPlayw "Z", Enit EJ), nawhantranDistancerPlayer "Z", Ex(t Ez) ) + Penalty Penoly = Number of tuscefe cells colockaget poisanous squares) with 4 degree of a. If Roboe ' A ' starts the play, construct game tree with uniliry up to level 3 or cone round per player and one more round by the MAX playes. b. Implemaent a MIN.MAX algonithm for the game tree constructed usder part n. 2. Depict the search tiee for up to esactly thee levels ie, level 3. (Oiveu initial state can be assaned to be cat level-6. with calculated jath cout sberun in tlee diagnea neally b. Compule tine hoseribie value for each state sud elueck the admissibility and consistency for any three generated states. Heuristics is given by, H()=2 (Mahhatran distance (Pacmastgen. Frip) c. Incplemeal the A algocithin eoly for the first 4 closed liat updates. Sbow the stanas of OPPN and CLOSE list ar ench level