It is possible to represent a maze using a two-dimensional array of Boolean variables, where if a certain cell has the value true it means the cell is free, and if it has false it means the cell is blocked. A way out of the maze is a series of cells starting with cell [0][0] and ending with the cell in the last row and last column. You can move from one cell to another only in one of the four directions - up, right, down and left, and only if the other cell does not contain false and is not outside the array's boundaries. For example, the following array represents a maze. The source cell is marked with a circle and the target cell is marked with a star. The leading line between the two cells marks the way out.

Write a class called TestQ2. Write inside the department a method signed by: public static boolean solution(boolean[][] maze) The method will receive as a parameter a boolean array that represents a maze. The method will return true if there is a way out of the maze as described above, and false if not. Do not use loops at all in this question! It is allowed to define private helper methods. Do not use loops in the helper methods either.