Prove that InsertionMerge solves the same problem as the Merge algorithm of p. 3031 in the textbook but works in place. Hint: use a loop invariant.

This Is the Merge pseudo code from textbook pgs. 30-31

MERGE(A, p.q.r) 2 n2 = r-q 3 let L.n and R[1..n2 +1] be new arrays 4 fori toi [i] = A[p + i-1) 6 forj1 to n2 10 i=1 12 for k -p to r 13 if LiRU 14 15 16 A[k] = L[i] i=i+1 else A[k] = R[j] 17