Recursion count Java groups

Please write new code in Java to recursively do the following

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 2 marks are grouped at each of the coordinate pairs. Example: ...??????? ???..., ??, ??? ????, ???....... ???????... ?? 2??, ????. 11272066 output: 0 16 4 13 code given: int start(int a, int b) { \/code goes here