In java recursively go through 3x3 matrix filled with "$"s and ","s.

Determine if it is possible to start at top left and get to bottom right.

You can move up, down, left, and right. But not diagonally.

Can't move through "$" but can freely move through ",".

Return "yes" if if is possible to to get through the maze. If not, return "no"

Code given:

String start(char[][] m) {

}