Recursion Count in Java

Given a maze made by a character matrix filled with "@" and "," in Java recursively find out if its solvable. Determine whether or not it is possible to get from the top left corner (0,0) to the bottom right (m.length- 1, m[O].length-1) of the 3x3 matrix. You can move left, right, up, and down. BUT NOT diagonally. You cannot move through "@" but can freely move through "," You can use a helper method to assist in solving this problem. If it is possible to get through the maze, return "yes". If it is not possible to get through the maze, return "no". This problem is a very common contest problem type. Return yes or no. Code given: String start(char[m) { \/code goes here