Suppose that there is a robot in an N-byN grid. This robot wanders freer around the N9 possible cells. At each time step t- = 'l, 2, 3, the robot is in some cell If e {Lei-IE}. and it moves randomlyto the cell XHJ- With probability {1 - e}. It chooses one of up to four of Its neighborhood cells. uniformly at random. With the probability of E. It uses a magical teleportation power to transport Itself Instantly to a random cell. uniformly at random among the NE possibilities. Note that the robot might teleport to the same cell. Suppose that E = 0,5 and N = 10. and the robot starts at X1 ={'I_1]. At each time step 1:, you cannot see it; but you can see E :. which Is the row that the robot is In. In otherwords. le1 = (nci. then E; = r. Also suppose that we will observe E1 = 1. E9 = 2, and E3 = 10. Taking the evidence into consideration, what is the probability that the robot is in (2,3) at time step 2? (Hint You do not need to perform heavy calculations. Give your answeras a decimal to the tenthousandths place.) 0.01 6? J correct Correct! Without considering the evidence. the probability that the robot will be at (1, 2] or {2. 1] is 51.2200 (or 0.5 0.5 + 0.50.011. and the probability that the robot In any other cell Is \"200 {or D.5*D.Di]. When we add In the evidenCe at step 2 {E2 = 2), we know that the robot is in row 2,. which removes the probability that the robot is not in row 2. That leaves {2. \"with probability S'I J'ZDO, and any other cells in row 2 with probabilityr 11'200. After nonnallzation. we learn that the probability that the robot Is at [2. 1] at step 2 is 0.85. Thus. the