1. Given a square matrix with the elements 0 or 1 , write a program to find a maximum square submatrix whose elements are all 1s. Your program should prompt the user to enter the number of rows in the matrix. The program then displays the location of the first element in the maximum square submatrix and the number of rows in the submatrix. Your program should implement and use the following method to find the maximum square submatrix: public static int[] findLargestBlock(int[][] m) The return value is an array that consists of three values. The first two values are the row and column indices for the first element in the submatrix, and the third value is the number of the rows in the submatrix. Sample Run: Enter the number of rows in the square matrix: 5 Enter the matrix row by row: 1111101000111110011111111 The maximum square submatrix is at (2,2) with size 3 Given a binary matrix, find out the maximum size square sub-matrix with all 1s. Algorithm: Let the given binary matrix be M[R][C]. The idea of the algorithm is to construct an auxiliary size matrix S[][] in which each entry S[i][j] represents size of the square sub-matrix with all 1s including M[i][j] where M[i][j] is the rightmost and bottommost entry in sub-matrix. 1) Construct a sum matrix S[R][C] for the given M[R][C]. a) Copy first row and first columns as it is from M[][] to S[][] b) For other entries, use following expressions to construct S[][] If M[i][j] is 1 then S[i][j]=min(S[i][j1],S[i1][j],S[i1][j1])+1 Else /*If M[i][j] is 0/ S[i][j]=0 2) Find the maximum entry in S[R][C] 3) Using the value and coordinates of maximum entry in S[i], construct the return array For the given M[R][C] in above example, constructed S[R][C] would be: 010110111120101220011230100010 The value of maximum entry in above matrix is 3 and coordinates of the entry are (4, 3). Using the maximum value and its coordinates, we can find out the return array: {2,1,3}