Suppose the robot is dropped into a rectangular {not necessarily square} grid of rooms and starts in the northwest oorner oi the grid. Come up with an algorithm that the robot can use to gure out how manyr rooms are in the grid. Type it up and save it on the same text file as before, including a description of the number of moves needed for an nbym grid. If your 3.1 algorithm still works, you are welcome to submit it again for 3.2