Consider the following implementation of the insertion sort algorithm public static void insertionSort(ArrayList nums) { for (int i = 1; i 0 && temp > nums . get(index - 1)) { nums . set(index, nums . get(index-1)) ; index -- ; 3 nums . set(index, temp) ; An ArrayList containing the values [11, 8, 12, 7, 21, 15, 1] is sorted using the above method. What is stored in the ArrayList after the for loop has executed twice? Learning Objective CON - 2.L Apply selection sort and insertion sort algorithms to sort the elements of array or ArrayList objects O [8, 11, 12, 7, 21, 15, 1] [12, 11, 8, 7, 21, 15, 1] O [11, 8, 12, 7, 1, 15, 21] O [7, 8, 11, 12, 21, 15, 1]