Chapter 11, Problem 11.9PE

(Largest rows and columns) Write a program that randomly fills in 0s and 1s into an n-by-n matrix, prints the matrix, and finds the rows and columns with the most 1s. (Hint: Use two ArrayLists to store the row and column indices with the most 1s.) Here is a sample run of the program:

  Enter the array size n: 4

  The random array is

  0011

  0011

  1101

  1010

  The largest row index: 2

  The largest column index: 2, 3