JAVA RELATED

Escaping a Maze Implementation. You are currently located inside a maze, at the position marked with a period (.). The walls of the maze are indicated by asterisks (*). Use the following recursive approach to escape from the maze: Try moving in each of the four possible directions. If you found an exit, return true. If you found a wall or a position that you have previously visited, return false. If you found an empty spot, mark it as a period, and recursively call the escape method again. This method merely tests whether there is a path out of the maze. The program should work from any starting position