Do you know how to fi nd your way through a maze? After you write this program, you will never be lost again! Assume that a maze is a rectangular array of squares, some of which are blocked to...

Do you know how to fi nd your way through a maze? After you write this program, you will never be lost again! Assume that a maze is a rectangular array of squares, some of which are blocked to represent walls. The maze has one entrance and one exit. For example, if x ’s represent the walls, a maze could appear as follows:

 xxxxxxxxxxxxxxxxxx x

 x x xxxx x

 x xxxxx xxxxx xx x

 x xxxxx xxxxxxx xx x

 x x xx xx x

 x xxxxxxxxxx xx x

 xxxxxxxxxxxx o xxxxxxx

 A creature, indicated in the previous diagram by o , sits just inside the maze at the entrance (bottom row). Assume that the creature can move in only four directions: north, south, east, and west. In the diagram, north is up, south is down, east is to the right, and west is to the left. The problem is to move the creature through the maze from the entrance to the exit (top row), if possible. As the creature moves, it should mark its path. At the conclusion of the trip through the maze, you should see both the correct path and incorrect attempts. Write a program to solve this problem.