6. 3 is a subjective queston, hence you have to write your answer in the Text.field given below. Two Robots A and B competes to leave the maze through either of exits: E1 and E2, as shown in the diagram. At each time step, each Robot move to an adjacent free square. Robots are not allowed to enter squares that other robots are moving into. The same exit cannot be used by both robots at once, but either robot may use either exit. A poisonous gas is left behind when a robot moves. No robot may enter the poisonous square for the duration of the gas's I-time-step presence (ie., If the square is left free for one game round, the poison evaporates and is no longer dangerous). The poisonous squares are represented as 's in the diagram. For utility calculation gonsider the below assumptions. H(n)= (Max player's ability to win in the board position) - (Min player's ability to win in the board position) Note: Player "Z's" ability to win is given by belos: Utility = Minimum ( manhanttanDistance(Player "Z", Exit EI), manhanttanDistance(Player "Z", Exit E2)) + Penalty Penaity = Number of wnsafe cells (blockaget poisonous squares) with 4 degree of the boert position) Netes Player "Z's" ability to win is given by briow: Urilify = Minimum ( manhanttanDistance(Ploge "Z". Drif Eld, manharthanDiatance(Plajer ( Z firi E E 2)+ Penalty frecdomito. Down. Right, Lefy is the immentiote matburlowe of the Plaver "Z's" position. If Robot 'A' stars the play, coastruat game tree with wnliry op to level 3 or one round per player and one more round by the MAX gloyer. Impleaneat a MIN-MLX algorithm for the gneae tree coestructed under part a