Please provide the Java code for the following:

Basic Directions:

1.define the maze in a text file

2.read the maze data from the file

3.draw the maze on the screen

4.ask the user which direction to move

5.check the motion requested is legal

6.check if maze is solved

7.loop on asking direction until solved

Full Directions:

Given the starting point in a maze, you are to find and mark a path out of the maze which is represented by a 30x20 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. Include previous/parent pointers. You may not move diagonally. For this program, use can ONLY use a single linked list.

Program Requirements:

Your program should use single linked list ONLY for finding the path. Find all possible paths and store the coordinates in a stack, queue, etc.

Example coordinates: 3x2, 4x4, etc.

Input of program: Input is a 30x20 array of characters (1s, 0s, and E) from a text data file (maze.txt); as follows:

E0001110000000100100

11100011101110001111

11111000101000111000

00001110101100010010

01011000101111000110

00001110000110011110

11011100110110111000

00011110110111111101

01011011110110100001

01000000000110110111

11011011010010000000

01010010011000101011

01111000101110101110

00001110000111011001

01101011101101000011

11000110100111011010

01110000100100110011

11010111110110000000

01110100011000111110

00011001000011100010

01000000000110110111

11011011010010000000

01010010011000101011

01111000101110101110

00001110000111011001

01101011101101000011

11000110100111011010

01110000100100110011

11010111110110000000

01110100011000111110

Each data line consists of one row of maze. Starting points (i.e. a row, column pair) in the maze will be input from the keyboard.

Output of program: Print the maze complete with numbered rows and columnsprior to asking the user for their starting point. For each entry into the maze, print the complete maze with a S in the starting point followed by the words I am free if you have found a path out of the maze or the words Help, I am trapped if you cannot. Your output could be in two formats:

Print the path (by using a series of pluses (+)) you took through the maze should one be found, OR Print the path as a single linked list.

Use exception handling where appropriate.