1) Rewrite the procedure Merge procedure so that it does not use sentinels, instead stopping once either array L or R has had all its elements copied back into A and then copying the remainder of the other array back into A.

2) Consider the procedure Merge loop invariant (for procedure Merge lines 1217) given on page 32 and proved with the Initialization / Maintenance / Termination discussion on pages 3233. Modify this loop invariant and the Initialization / Maintenance / Termination discussion to argue that your modified Merge procedure is correct.

Hw 1 Problem 9 (10 pts) Complete Problem 1-1. Hints: (1) Use a spr (2) There are 1,000,000 (10) microseconds in a second. (3) Your answer only needs to be accurate to 3 significant digits. (4) Do the line marked n first. (5) A closed form solution is possible fo all lines except ngn nd n!:you will be solvingfo the inverse of fIn). eadsheet