91Ó°ÊÓ

Consider a 2-by-3 integer array t. a. Write a declaration for t. b. How many rows does t have? c. How many columns does t have? d. How many elements does t have? e. Write the names of all the elements in row 1 of t. f. Write the names of all the elements in column 2 of t. g. Write a single statement that sets the element of t in row 1 and column 2 to zero. h. Write a series of statements that initialize each element of t to zero. Do not use a loop. i. Write a nested for statement that initializes each element of t to zero. j. Write a statement that inputs the values for the elements of t from the terminal. k. Write a series of statements that determine and print the smallest value in array t. l. Write a statement that displays the elements in row 0 of t. m. Write a statement that totals the elements in column 3 of t. n. Write a series of statements that prints the array t in neat, tabular format. List the column subscripts as headings across the top and list the row subscripts at the left of each row.

(Selection Sort) A selection sort searches an array looking for the smallest element. Then, the smallest element is swapped with the first element of the array. The process is repeated for the subarray beginning with the second element of the array. Each pass of the array results in one element being placed in its proper location. This sort performs comparably to the insertion sortfor an array of \(n\) elements, \(n 1\) passes must be made, and for each subarray, \(n 1\) comparisons must be made to find the smallest value. When the subarray being processed contains one element, the array is sorted. Write recursive function selectionsort to perform this algorithm.