Breadth First and Depth First Search Maze

Problem: You will design a program to navigate a maze, following a search strategy specified by the user. The maze must be read in from a text file using the following encoding: represent walls by X, the entrance by E, and the exit by F. See the example input file below. Example Maze file: XXXXXXXX X X X X X XX F X X X XEXXXXXX The program must graphically display the maze. This includes the progress through the maze at each step and the final path through the maze. Ensure the programs pauses long enough at each step for the user to see the current position. The path of the solution through the maze must be distinguished from the rest of the maze that has been explored. If using ASCII to display, a means to denote the progress through the maze is using 0 (zero) for correct path and 1 (ones) for explored areas not part of the solution. When the search is complete, display the length of the path if a solution is found, or indicate that no solution was found. However, you are not limited to using ASCII. You can employ richer means of visualization like the Java 2D API if you feel like that won't be too much more difficult. After reading in and displaying the initial state of the maze, but before beginning the search, the program must prompt the user to choose a search strategy. Include at least breadth first search AND depth first search as options; however, you can add additional search strategies if you would like. I would like the program to be written in Java. Please use good documentation and comment code where it would be useful for me to understand what the section of code does. Both listed search strategies must be used, but if you'd like to implement an additional one you can. You can make it look graphically better if you're familiar with working with that, but please keep it in java. Any other questions feel free to message me.