Write a method which is passed a two-dimensional array of int row by row. Do not assume that each row has the same number of columns.

Write a method which is passed a two-dimensional array of int column by column.

Implement the method:

/* sets every value in A[][] to initVal */ public static void initialize(int A[][], int initVal) 

Implement the method:

/* returns the largest element in A */ public static int largestItem(int A[][]) 

Implement the method:

/* returns the sum of the row in A that has the largest * sum. */ public static int largestRow(int A[][]) 

Implement the method:

/* Returns column i of A as an array. For example, if */ /* A[][] is: */ /* |-----+-----+-----+-----+-----| */ /* | 10 | 20 | 30 | 40 | 50 | */ /* |-----+-----+-----+-----+-----| */ /* | 60 | 70 | 80 | 90 | 100 | */ /* |-----+-----+-----+-----+-----| */ /* | 110 | 120 | 130 | 140 | 150 | */ /* |-----+-----+-----+-----+-----| */ /* and i is 1, the method returns the array */ /* */ /* |----+----+-----| */ /* | 20 | 70 | 120 | */ /* |----+----+-----| */ /* */ /* You may assume that every row has */ /* the same number of columns. */ public static int[] getCol(int A[][], int i) 

Implement the method:

/* returns the sum of the column in A that has the largest * sum. You may assume that each row has the same number * of columns. */ public static int largestCol(int A[][])