A ragged array is a) A two-dimensional array for which the number of rows is unknown b) A one-dimensional array for which the number of elements is unknown c) A two-dimensional array when the rows are different lengths d) There is no such thing as a ragged Given the following two-dimensional array declaration, which statement is true? int [][] numbers = new int [6][9]; a) the array number has 6 columns and 9 rows b) the array numbers has 6 rows and 9 columns c) the array numbers has 15 rows d) the array numbers has 54 rows When an individual element of an array is passed to a method a) A reference to the array is passed b) It is passed as an object c) The method does not have direct access to the original array d) All of the above If a [] and b[] are two integer arrays, then if (a = = b) compares the array contents. a) True b) False The binary search algorithm a) Is less efficient than a sequential search b) Will cut the portion of the array being searched in half each time the loop locate the search value c) Will have a maximum number of comparisons equal to the number of the array d) Will have an average of N/2 comparisons, where N is the number of the array Java does not limit the number of dimensions that an array may have. a) True b) False