Can you answer the following using Java. I included some of the code template to begin with:

We$$ll build a program that can read a $2-$dimensional cave layout from a file, search the layout to find a path to a mirror pool, then print the path to take. This unit, you will build the infrastructure for this project, including storing data in a two dimensional structure, searching the data structure for a simple path from start to finish and reading data from a text file. Do not use recursion or backtracking for this part.

Directions $-$ Write a class CaveExplorer, that has the following methods:

$1.$ Constructor with no parameters. It should create the two$-$dimensional structure shown below, where the characters in the layout are $$R$$ for rock, $.$ for a clear path, $$M$$ for mirror pool, and $$S$$ for self. This constructor hardcodes the cave without reading from a file.

RRRRRR

R$..$SRR

R$.$RRRR

R$.$MRRR

RRRRRR

$2.$ toString $$ no parameters, returns a string $($including new lines$)$ showing the current state of the cave exploration. For the initial configuration, this string would be

$"$RRRRRR

R$..$SRR

R$.$RRRR

R$.$MRRR

RRRRRR

$"$

$3.$ solve $$ no parameters, returns a boolean true if there is a path to the mirror pool, and false if there is not.

$4.$ getPath $$ no parameters, returns a String showing the path taken to get to the mirror pool. In the example, this path would be the string of directions $$wwsse$$ for West, West, South, South, East. The method should return the empty string if there is no path.

$5.$ Constructor with one String parameter $$ the name of a text file with the cave layout. The file has a line with two integers, the number of rows and columns of the cave layout, followed by the layout itself. For example:

$56$

RRRRRR

R$..$SRR

R$.$RRRR

R$.$MRRR

RRRRRR

Your cave layout should contain a path requiring at least $4$ moves in two different directions. There must be exactly one path through the cave, that is$,$ from any location, there is only at most one location to move to next that hasn't already been visited.

$6.$ main $$ test your class by writing a main method that creates at least $2$ CaveExplorer objects, solves each one, then prints the starting layout, the final layout, and the path taken, if it exists, for each one.