Consider the following correct implementation of the insertion sort algorithm. public static void insertionsort(int i elements) for (int j - 1; j 0 66 temp elements possibleIndex) - tempi 1 The following declaration and method call appear in a method in the same class as insertionsort. int[] arr = {4, 12, 4, 7, 19, 6); insertionsort(arr); How many times is the statement possibleindex-; in line 10 of the method executed as a result of the call to insertionsort ? The following declaration and method call appear in a method in the same class as insertionsort. int[] arr - [4, 12, 4, 7, 19, 6); insertionsort(arr); How many times is the statement possibleIndex--, in line 10 of the method executed as a result of the call to insertionsort ? A 2 3 5 E 6