Can you answer question number 3?

2. (4 points) The following is a pseudocode of Insertion-sort. For instance A[1... 8) = (7,4, 2, 9, 4, 3, 1,6), what is A[1...8) just before the for-loop starts for j = 5? Insertion-Sort (A) 1. for j = 2 to A.length 2. key = A[j] 3. // Insert A[j] into the sorted sequence A[1... j - 1]. 4. i = j - 1 5. while i > O and A[i] > key 6. A[i + 1] = A[i] 7. i = i - 1 8. Ai + 1] = key 3. (a) (3 points) Give an instance of size n for which the Insertion-sort terminates in 2(n?) time. (b) (3 points) Give an instance of size n for which the Insertion-sort terminates in O(n) time