Consider the following sort method. This method correctly sorts the elements of array arr into increasing order.

public static void sort(int[] data)
{
for (int j = arr. length 2; j >= 0; j--)
{
int move = arr[j];
int k = j + 1;
while (k < arr. length && move > arr[k])
{
arr[k - 1] = arr[k]; /* Shuffle elements upwards */
k++;
}
arr[k - 1] = move; /* Insert value into position */
/* end of for loop */
3
}

Assume that sort is called with the array(4,1,0,3,5,2). What will the value of arr be
after two passes of the for loop (i. e. when j = 3 at the point indicated by /* end of for loop
7)?

A. 0,1,2,3,4,5
B. 4,0,1,2,3,5
C. 4,1,0,3,5,2
D. 4,1,0,3,2,5
E. 4,1,0,2,3,5

Write the command that can be used to answer the following questions. (hint: try each out on the system to check your results.) a. find all files on the system that have the word test" as part of their filename. b. search the path variable for the pathname to the awk command. c. find all files in the /usr directory and subdirectories that are larger than 50 kilobytes in size. d. find all files in the /usr directory and subdirectories that are less than 70 kilobytes in size. e. find all files in the / directory and subdirectories that are symbolic links. f. find all files in the /var directory and subdirectories that were accessed less than 60 minutes ago. g. find all files in the /var directory and subdirectories that were accessed less than six days ago. h. find all files in the /home directory and subdirectories that are empty. i. find all files in the /etc directory and subdirectories that are owned by the group bin."