The code for the selection sort algorithm, implemented to sort items in ascending order, is shown below. Assume the algorithm is given the following input array:

{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}

Match each statement on the left with the formula on the right that best describes the statement's performance in terms of the number of times the statement is executed. You may use the same formula for more than one statement. Pay close attention to where the loop indexes begin and end, and be sure to carefully trace how the code would be executed for the given input. Don't make unwarranted assumptions! You may want to instrument the code to help you with this question.

public Comparable[] selectionSort(Comparable[] objArray) { for (int i = 0; i < objArray.length - 1; i++) { Comparable min = objArray[i]; int indexOfMin = i; for (int j = i + 1; j <= objArray.length - 1; j++) { if (objArray[j].compareTo(min) < 0) { min = objArray[j]; indexOfMin = j; } } Comparable temp = objArray[i]; objArray[i] = objArray[indexOfMin]; objArray[indexOfMin] = temp; } return objArray; }

int i = 0;	0
i < objArray.length - 1	N(N+1)2-1
Comparable min = objArray[i];	n^2
int indexOfMin = i;	N-1
int j = i + 1;	N+1
j <= objArray.length - 1;	N(N+1)(n+2)/6
if (objArray[j].compareTo(min) < 0)	N
min = objArray[j];	1
indexOfMin = j;	N(N+1)/2-N
j++;
Comparable temp = objArray[i];
ObjArray[i] = objArray[indexOfMin]
objArray[indexOfMin] = temp;
I++;
return objArray;