---------------------------------------------------------------------------------------------------------------------------------------------------------------------

MazeDemo.java

public class MazeDemo { public static void main(String args[]) { char[][] m = { {'*', ' ', '*', '*', '*', '*', '*', '*', '*'}, {'*', ' ', ' ', ' ', ' ', ' ', '*', ' ', '*'}, {'*', ' ', '*', '*', '*', '*', '*', ' ', '*'}, {'*', ' ', '*', ' ', '*', ' ', ' ', ' ', '*'}, {'*', ' ', '*', ' ', '*', '*', '*', ' ', '*'}, {'*', ' ', ' ', ' ', '*', ' ', ' ', ' ', '*'}, {'*', '*', '*', ' ', '*', ' ', '*', '*', '*'}, {'*', ' ', ' ', '*', ' ', ' ', '*', ' ', '*'}, {'*', '*', '*', '*', '*', '*', '*', ' ', '*'}}; Maze maze = new Maze(m); System.out.println(maze.escape(4, 3)); System.out.println("Expected: true"); System.out.println(maze.escape(5, 5)); System.out.println("Expected: false"); } }

Given the provided MazeDemo class to test your program, write the Maze class which will solve the problem. You are currently located inside a maze. The walls of the maze are indicated by asterisks(*). Use the following recursive approach to check whether you can escape from the maze: If you are at an exit, return true. Recursively check whether you can escape from one of the empty neighboring locations without visiting the current location. This method merely tests whether there is a path out of the maze