Consider the following correct implementation of the selection sort algorithm. public static void selectionSort(int[] elements)

{

for (int j = 0; j < elements. length - 1; j++)

{

int minIndex = j;

for (int k = j + 1; k < elements. length; k++)

{

if (elements[k] < elements[minIndex])

{

minIndex = k; // Line 11

}

}

if (j != minIndex)

{

int temp = elements[j];

elements[j] = elements[minIndex];

elements[minIndex] = temp;

}

}

}

The following declaration and method call appear in the same class as selectionSort.

int[] vals = {5, 10, 2, 1, 12};

selectionSort(vals);

How many times is the statement minIndex = k; in line 11 of the method executed as a result of the call to selectionSort ?