Suppose that you want to sort an array into ascending order using insertion sort. the array contains the integers 0 through n in some order, where n is even and n > 2. (that means it contains n+1 integers! ) during the quiz, you will be asked how many comparisons are performed in various situations. this refers to comparisons of the array elements being sorted. in each case, express your answer as a polynomial in simplest terms

a)

suppose the array begins with 0, followed by the remaining even numbers in ascending order, followed by the odd numbers in descending order. (for n = 8, the array would be [0,2,4,6,8,7,5,3,1].)

how many comparisons will insertion sort perform when it is executing the pass that moves the element at index 1 into position? (do not assume n = 8.)