Given the starting point in a maze, you are to find and mark a path out of the maze, which is represented by a 20x20 array of 1s (representing hedges) and 0s (representing the foot-paths). there is only one exit from the maze (represented by e). you may move vertically or horizontally in any direction that contains a 0; you may not move into a square with a 1. if you move into the square with an e, you have exited the maze. if you are in a square with 1s on three sides, you must go back the way you came and try another path. you may not move diagonally. for this program, use can only use a single linked list.