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;
}
}
if (j != minIndex)
{
int temp = elements[j];
elements[j] = elements[minIndex];
elements[minIndex] = temp; // line 19
}
}
}
The following declaration and method call appear in a method in the same class as selectionSort.

int[] arr = {30, 40, 10, 50, 20};
selectionSort(arr);

How many times is the statement elements[minIndex] = temp; in line 19 of the method executed as a result of the call to selectionSort ?

a. 1
b. 2
c. 3
d. 4
e. 5