below shows four grids, each containing a robot represented as a triangle The robot cannot move to a black square or move beyond the edge of the grid Which of the following algorithms will allow the robot to make a single circuit around the rectangular region of black squares, finishing in the exact location and direction that it started in each of the four grids? Step 1 keep moving forward, one square at a time until the square to the right of the robot is black Step 2: Turn right and move one square forward. Step 3: Repeat steps 1 and 2 three more times B Step 2 Step 1: Keep moving forward, one square at a time until the square to the right of the robot is no longer black Turn right and move one square forward Step 3: Repeat steps 1 and 2 three more times Step 1: Move forward three squares. Step 2 Tum right and move one square forward Step 3: If the square to the right of the robot is black, repeat steps 1 and 2 Step 1 Step 2 Step 2 Move forward three squares Turn right and move one square forward if the square to the right of the robot is not black repeat steps 1 and 2