Not sure if I did the mergesort execution correct as well as the merge execution. Can you try explaining it visually sort of like how I was approaching it visually. After that translate it to c++ code if possible. I saw another post that used int *L = new int[n1+1] in the merge function which is the same as int L[n1 +1]correct?

Heres my driver function

int main () cout > A[i]; 3115210 Merge sort( A, O, size-1); A er OT 2 3 4 Merye sort(A; 0,4) if ocu 9= (0+u)/2 112] Merge sort(,0,2) Apr Merge sort [1,2,2) if 262 Il False Moge sort (A, 0,2) Q = 0+2/2 1-1 = 1 Skips this call MERGE-SORT(A, p.r) 1 if p