solve a maze using stack in java

CS 301/600 Spring 2016 Assignment Stacks and Backtracking Write an application that finds a path through a maze. The maze should be read from a file. A sample maze is shown below. O O O O O X O X X O X O O X O X O O X X X X X X O O X O X X X X O O X O O O O O O O X X O X X X O The character 'X' represents a wall or a blocked position and the character 'O' represents an open position. You may assume that the entrance to the maze is always in the lower right hand corner, and the exit is always in the upper left hand corner. Your program should send its output to a file. If a path is found the output file should contain the path. If a path is not found a message should be sent to the file. As you move through the maze you can move up or down, left or right. You may not move diagonally. Please note that a maze may have more than one solution path, but in this exercise you are only being asked to locate one solution, not all solutions. I have attached several data files that you may use to test your code. The first line of the data file will contain two integers. The first integer gives the number of rows in the maze, and the second integer gives the number of columns in the maze. The following lines contain the actual maze. Each line will be a collection of characters, either 'X' or 'O'. There is a space between the characters. Your program should use a stack to record the path that it is exploring and backtrack when it reaches a blocked position.