7. . Rewrite the Insertion Sort algorithm (Algorithm ) as follows. Include an extra array slot S[0] that has a value smaller than any key. This eliminates the need to compare j with 0 at the top of the while loop. Determine the exact time complexity of this version of the algorithm. Is it better or worse than the time complexity of Algorithm given here? Which version should be more efficient? Justify your answer.

Algorithm:

void insertionsort (int n, keytype S1) index i, j; keytype r; for (i= 2; i r)l S[j + 1] = x