An array of Integers is to be sorted biggest to smallest using the insertion sort method. If the array arr originally contains:
[1 7 9 5 4 12]
What will it look like after the third pass of the for loop?

for (int i = 1; i < arr.length; i++)
{
        int curNumber = arr[i];
        int curIndex = i-1;

        while (curIndex >= 0 && arr[curIndex] < curNumber)
        {
            arr[curIndex+1] = arr[curIndex];
            curIndex--;
        }

        arr[curIndex + 1] = curNumber;
}

1. Correct Answer
   Incorrect Answer
   a

   [9 7 1 5 4 12]

2. Correct Answer
   Incorrect Answer
   b

   [9 7 5 1 4 12]

3. Correct Answer
   Incorrect Answer
   c

   [12 9 7 1 5 4]

4. Correct Answer
   Incorrect Answer
   d

   [12 9 7 5 4 1]

5. Correct Answer
   Incorrect Answer
   e

   [9 7 12 5 4 1]