You are designing a program for a robot that enables it to find its way from the bottom left of an obstacle course to the top right of the course. The number and position of the obstacles may change each time the robot attempts the course, but there will always be at least one path the robot can follow You have been given a sample obstacle course to help with your testing. This is shown on the next page. The robot's position is denoted by a large R. The destination is denoted by a large X. It is able to move up and down, or left and right, but not diagonally. The robot must not go outside the obstacle course grid at any time. Obstacles are shown by blacked out squares, which the robot must go around a) You attempt to move the robot using the algorithm provided on the next page Explain, using step-by-step directions, what happens when the robot moves through the obstacle course following this algorithm b) Change the algorithm so that the robot can progress through the obstacle course. You do not need to rewrite the entire algorithm provided you make it clear where your changes apply within the existing algorithm c) Explain, using step-by-step directions, what happens when the robot moves through the obstacle course using your revised algorithm. State whether or not the robot successfully completes the obstacle course