We need to complete the following code :

1. Problem: Apply Robot localization that you have learned in Chapter 1 Localization using Histograms (Monte Carlo method), to the case of a 2D world of arbitrary dimensions nx m Assume that a robot can move only left, right, up, or down. It cannot move diagonally. Also, for this assignment, the robot will never overshoot its destination square; it will either make the movement or it will remain stationary Assume a cyclic world Measurement RR G RRG R R Motion Commands [0,0 - no move 0,1 - right [0,1 - left 1,0 - down [-1,0 - up Begin with a UNIFORM distribution. 2. Programming The function localize takes the followi ng arguments: colors: 21) list, each entry either . R ' (for red cell) or G" (for green cell) 1. Problem: Apply Robot localization that you have learned in Chapter 1 Localization using Histograms (Monte Carlo method), to the case of a 2D world of arbitrary dimensions nx m Assume that a robot can move only left, right, up, or down. It cannot move diagonally. Also, for this assignment, the robot will never overshoot its destination square; it will either make the movement or it will remain stationary Assume a cyclic world Measurement RR G RRG R R Motion Commands [0,0 - no move 0,1 - right [0,1 - left 1,0 - down [-1,0 - up Begin with a UNIFORM distribution. 2. Programming The function localize takes the followi ng arguments: colors: 21) list, each entry either . R ' (for red cell) or G" (for green cell)