Q1. (a) Explain the Insertion Sort Algorithm for ordering a list L of n objects. Calculate how many (b) Prove that the worst case complexity of Insertion Sort is O(n2). Exactly how many comparisons (c) If an Insertion Sort of 101 items took 70 seconds, how long would you expect it to take for an comparisons are needed in an insertion sort of the list [23, -4, 8, 1, -20, are made, in the worst case, in an insertion sort of n objects? insertion sort of i. 106 items? ii 1,000 items