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; i >= 0; j--)
{
int move = arr[i];
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 (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?

A. Shuffle: 10, Insert: 5
B: Shuffle: 14, Insert: 4
C. Shuffle: 10, Insert: 4
D. Shuffle: 15, Insert: 5
E. Shuffle: 15, Insert: 4