please implement this method.

* Problem 10.62 (a): Let A be an n-by-n matrix of zeros and ones. A submatrix * S of A is any group of contiguous entries that forms a square. Design an *O(n2) algorithm that determines the size of the largest submatrix of ones *in A. ublic class LargestSquareSubmatrix { k * *Returns the size (i.e., side length) of the largest square of ones found * within the first n rows and first n columns of mat. Assume n 0 and * n 0 & n