Help a robot move along its track (with spaces numbered 0 through 99) by calculating its new position when given `direction` equal to "forward" or "backward" and `number_of_moves` indicating a non-negative number of spaces. Keep in mind that the robot can't move past the 0 or 99 spot so when it reaches either end it stays there. what is the general algorithm/approach for solving this problem? as a test case, move_robot 10 forward 3 = 13