Question: second picture is the file but it should work on any maze. please use Java! Traverse a maze recursively. Your program MUST read from a

Traverse a maze recursively. Your program MUST read from a file called "maze.dat". A sample maze has been provided. The actual maze will be larger. The start and end of the maze are represented with the characters + and -, respectively. The first line of the maze file will be the number of rows and columns, respectively. As your program moves through the maze the current path should also be marked with the + character. Any path leading to a dead end should be marked with the character. . Upon reaching the end of the maze your program should print a message to the screen stating that the maze was solved. If your program does not find the exit this should also be stated. All messages, and a print out of the solution, if one is found, should be to the screen. Here is the actual maze file that will be used to test your programs. 47 131 XXXXXXX XX CO 000 x x X X X X X x xox xxxxxxxxx xxxxxxxxxxxxxx xxxxx ox xxxx xxxxxxx xxxxx x xxxxxxxxx x xxx xx XX ox oxox xxx xxx xooooxx xxxxxxxxx xxxxxxx xxxxx xox oooox x cooooox X X XX xxx X x x X X X x xxxx xoo oooooooox x x xox oooooooox xxxxx oo oooot X XX x x x x x x x x X X X x xxxxxxx xxxxx xxxxxx xxxxxxxx xxxxx x oooooooooooooooox x oo oox x x xx x x X X XX x x x XX X XXXX X xx xxx x x X x x x x xxxx xxxx xxxxxxxxxxx xxxxx xxxxx xxxx xxx xxxxx xxxxx xxx xxxxxxx xxxx xxx xxx xxx xxxxx xx XX xxxx X X xxx x X X X XX X X X X X x xxxx X X X X X X x x x x x x x XX X X X X X X X xxx X XX x xxx xxxx xxxxxxxx xxxxxxxxxx xxxx xxxxxxx xxx xxxxxxoooooooxxx xxx xxxx xx XXXX x x x x x x X Xxx XX XX X X X oo oooo xoooooo xxx xxxx xxoooo oooox XX xx X X X X X X X X X x x XX 1 1 1 XXXX XXXX XXXX XXX XXXX XXXX XXX XXXXXXXX xx xxxxxx xxx X X X XX X X X X xxxxx X xxx x x XX XX XX XXX xxxx X X XX XX xxx xxx xxxxx xoooo oo oo oooo xxxxxx ooo oo oooox xx xxx XX X xx xxxx X xxxxxxx xoooo ooooooooooooooox x xoooooooooooooox x xxxxxx XX X XX XXX X X X X X xxx XX XX XXX xxxxxx X X x x x x x x XX XXX xxx ooooooooooooooooo XXXXXXX X XX x xxx XXX X X XXX XX x x X X X o oo oo o oo oo oo XXX X XXXXXX XX X X XX X XX xxxx X XX xxx
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
