Q @ 018 | Am o 91.4% Name: 10. (15 points) Prove that the following Merge-Sort is correct. That is, prove that Merge- Sort(A,pr) sorts the subarray A p...r in increasing order. You can assume that Merge A. p.4.1) successfully merges two sorted arrays, Ap...ql and Ag + 1...r], into a sorted array Ap...r). Please do not forget the base case. MERGE-SORT(A, p,r) 1 if p