C++ Maze Problem

I have posted this question multiple times and haven't gotten a responce ??. I am Understand were working with a pure virtual function to make it all work, but cant figuere out how to even get started. Please post valid code for me to start or complete. I have posted pictures of the problem + the following pages. THANK YOU!!!

never be los method to recognize a legal infix expression Do you know how to find your way through a maze? After you write this program, you will never h again! some of which are blocked to represent walls Assume that a maze is a rectangular array of squares, some or s one entrance and one exit. For example, if x's represent the walls, a maze could appear : ze could appear as follows: XXXXXXXXXXXXXXXXXX X XXXX X x xxxxxxxxxx xx x x xxxxx xxxxxxx xx x x x ?? ??? XXXXXXXXXXXXX XXXXXXXXXXXXoXXXXXXX A creature, indicated in the previous diagram by o. sits just inside the maze at the entrance (bot. tom 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 crea- ture 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. Squares in the maze have one of several states: CLEAR (the square is clear). WALL (the square is blocked and represents part of the wall), PATH (the square lies on the path to the exit), and VIS- ITED (the square was visited, but going that way led to an impasse). This problem uses two ADTs that must interact. The ADT creature represents the creature's current position and contains operations that move the creature. The creature should be able to move north, south, east, and west one square at a time. It should also be able to rene hould also be able to report its position and mark its trail. The ADT maze represents the maze itself, which is a two-dimene of squares. You could number the rows of squares from columns of squares from the left beginning with zero. You could top beginning with zero, and number the number to uniquely identify any square within the maze. The ould then use a row number and a column ent the maze. It also needs such data as the height and width of the ADT clearly needs a data structure to ad column coordinates of both the entrance to and the exit from the maze. squares and the row and column coordinates width of the maze given in numbers o e top bemensional