Question

Below is a method written to determine if an integer array is square or not. An array is square if it has the same number of elements in each dimension, and each "row" is the same length. Some examples: Square arrays: 1 1 1 1 1 1 1 1 1 1 2 3 4 5 6 7 8 1 1 1 1 1 2 3 1 Not Square arrays: 1 1 1 1 1 1 1 1 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 = public static boolean isSquare(int[][] a) { int len a. length; for (int i = 0; i < a.length; i++) { if (a[i].length != len) { return false; } else return true; option 1 for return true option 2 for return true return true; } return true; } // isSquare option 3 for return true

question 1:

Three options for "returning true" are shown in comments within the method above.  Which option is the correct one? Briefly explain.

question 2:

Assuming the array is of size n × n and it IS square, what is the complexity using Big-O notation of the method above for each of the three options for the location of "return true"? Briefly explain.

for question 2, its basically asking what are the three options