Escaping a Maze - JAVA

****public class maze {}

print out a '+' for the escape pattern

Use the MazeDemo class below as a reference to write your codes

Assume that you are currently inside a maze. The walls of the maze are indicated by asterisks () shown in the diagram below. Use the following recursive approach to find a path out of the maze. Below are some hints for the design and development of your recursion program: - If you have arrived at the exit, return true. - Recursively check whether you can escape from one of the empty neighboring locations; This method merely tests whether there is a path out of the maze. - Finally, you need to print out a path that can connect starting point (upper left) and the exit (bottom right). - The maze and the final result printing to the console are given below