Please help me this question

public static int [] [] smallestSubarray(int [][] array, int sum) It takes a rectangular array and returns a square-size subarray of it whose values have a sum that is equal or larger to sum. A subarray can't be smaller than 22. If there are more than one square-size subarrays that satisfy the requirements, the method must return the square that has the smallest size. If two or more equally-sized squares satisfy the requirements, it must return the square whose values have the highest sum. Assume that the sum has such a value that always warrants a solution (i.e. no need to check or worry about this)