Question 3 (3 points) Rewrite the MERGE procedure so that it does not use sentinels, instead stopping once either array L or R has had all its elements copied back to A and then copying the remainder of the other array back into A. MERGE(A, p, q, r) 1. n = 9-p + 1 2. n2 =r-9 3. let L[1..na] and R[1..nz] be new arrays // Note that there is no setinels 4. for i = 1 to ni 5. L[i] = A[p + i - 1] 6. for j = 1 to n2 7. R[j] = A[9 + j] 8. L[n + 1] = 0 9. R[n2 + 1] = 0 10. i = 1 11. j = 1 12. k=p 13. while and 14. if L[i] = R[j] 15. A[k] = L[i] 16. i = i + 1 17. else A[k] = R[j] 18. j = 1 + 1 19. k = k + 1 20. if i == n1 +1 21. for m = 22. A[k] = R[m] 23. k = k + 1 24. if j == n1 + 1 for m = 26. A[k] = L[m] 27. k = k + 1 to 25. to