Complete the function: use Java and add comments to the program

static int[] countGroups(int[][] m, int[] t)

{

}

For this question, you will be tinding groups ot adjacent cells in a two-dimensional array and determining how many groups of each specified size exist. As part of the input, you will be provided with a two-dimensional array where each cell has a value of either 0 or 1. Cells are considered to be in the same group if they both have a value of 1 and they are adjacent an adjacent cell is directly to the left, to the nght, up or down; diagonal is not considered Qdjacent lo define it strictly: any two cells M y) and 2 y2 fall into the same group f X, X2 y, y 7 and both cells have a value of 1 The group-size of a group is the number of cells in tht roup. Complete the countGroups function in your editor. It has 2 parameters: 1. An n x n two-dimensional array ot integers, m, where the value of each element miy (where j