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 {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 */)?

{4, 1, 0, 3, 5, 2}

{0, 1, 2, 3, 4, 5}

{4, 0, 1, 2, 3, 5}

{4, 1, 0, 2, 3, 5}

{4, 1, 0, 3, 2, 5}