Java recursion count

Please make sure it prints the output correctly. If possible, use strings, not integers or anything else since String a and String b have to stay Strings.

Code given:

int start(String a, String b) {

String[][] mat;

boolean[][] vis;

//code goes here

}

Please use the code and instruction given and try to keep all the code in the code given. Please keep code simply and short (Beginner recursive)

Go through the String a and store it in the matrix.

Please make sure you use Java, recursive, and the code given. Please also make sure that it prints

0

16

4

13

The size of fhe matrix is the ? and , along with the coordinates given in the picture. Something like 10 down and 10 across. You can add the coordinate pairs into a different matrix if needed. But do that in the start class not main

Write a code in java to recursively count how many "?" marks are grouped. A group is when "?" is touching left, right, up, and down. NOT diagonally. A comma is used to represent a blank space in the matrix. The first parameter will be a string containing all of the values in the grid. The values in the string must be converted into a String] matrix. The second parameter will contain a String that contains all of the coordinate pairs to check. Print out the number of ? marks are grouped at each of the coordinate pairs. Example: ??????? ???,,., ??, ?......??? ,????, ???... ???????,,, ???, ?? 11,????, 11272066 output: 16 4 13