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 */ } }

Assume that sort is called with the array {5, 4, 3, 2, 1} . How many times will the expression indicated by /* Shuffle elements upwards */ and the statement indicated by /* Insert value into position */ execute?

Shuffle elements upwards: 15, Insert value into position: 5

Shuffle elements upwards: 10, Insert value into position: 5

Shuffle elements upwards: 15, Insert value into position: 4

Shuffle elements upwards: 14, Insert value into position: 4

huffle elements upwards: 10, Insert value into position: 4