****In Java ****

Write a function to read elements of a n by n, 2 dimensional (2D) array and display the 2D array in a matrix form and find the first row and column with the most 1s.

Input 4

0 0 1 1

0 0 1 1

1 1 0 1

1 0 1 0

Where,

First line of represents n, the number of rows and columns.

Second line contains array elements of the 1st row and so on.

Output

0 0 1 1

0 0 1 1

1 1 0 1

1 0 1 0

2

2

where

There must be single space between 2 numbers in the row.

There should not be any space after the last number in the row. e.g. in the last row, there should not be any space after number 0.

The first number bellow the matrix is the index of the first row with the most 1s and the second number is the index of the first column with the most 1s.

There should not be any space after the second number (the index of the first column with the most 1s).

Assume that,

Row and column values are integers within the range [1 to 100].

2D Array elements are within the range [0 to 1].

Use the following class driver:

class Driver{ public static void main(String[] args){ HW3_P2 hw3P2 = new HW3_P2(); int[][] A = hw3P2.getArray(); int N = A.length; if(N > 0){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { System.out.print(A[i][j]); if (j < (N - 1)) { System.out.print(" "); } } if(i

and the class itterated from main

class HW3_P2{

public int[][] getArray(){ Scanner s = new Scanner(System.in); // write your code }

public int findFirstRow(int[][] matrix){ // write your code. You can add more methods if it is needed! } public int findFirstCol(int[][] matrix){ // write your code. You can add more methods if it is needed! }

}