An excellent example of a program that can be greatly simplified by the use of recursion is the Chapter 4 case study, escaping a maze. As already explained, in each maze cell the mouse stores on the maze stack up to four cells neighboring the cell in which it is currently located. The cells put on the stack are the ones that should be investigated after reaching a dead end. It does the same for each visited cell. Write a program that uses recursion to solve the maze problem. Use the following pseudocode:

exitCell(currentCell) if currentCell is the exit success ; else exitCell( the passage above currentCell); exitCell( the passage below currentCell); exitCell( the passage left to currentCell); exitCell( the passage right to currentCell);