4. (8) Consider the Insertion Sort algorithm given in pseudocode below. Pre: N2 I InsertionSort( Al1.N]: an array of numbers) Post: The elements of A have been sorted in increasing order.) 1) FORI := 2 TO N DO // For each position after the first 2) x ALi] 3) ji -1 4) WHILE AUIX ANDj2 1 DO I/Until x's position is found 5) 6) 7) END (WHILE 8) AU I Put x into the correct position 9) Print Al1.N Print the array 7) END (FOR // x is the element being "inserted" // Starting with the element to the left of x II Move Avl one position to the right II Go to the next element j-j-1 If we consider the assignment in statement 5) as the characteristic operation, derive the worst-case time complexity of the algorithm by setting up and simplifying a summation