The teacher is just looking for sudo code

2. (30 p) Merge Sort Revievw Algorithm Merge(A1, A2, A) Input: Array A1 and A2 are sorted, each element is comparable Output: A is sorted with data from A1 and A2 // Variable i points to the next element in A1, starting at 0 Variable j points to the next element inA,stating ato // Variable k points to the next element in A, starting at 0 // Repe at the following as long as both and j are in the valid index range * copy the smaller of A1t] and A20] to A[k], *increase (i orj) and k accordingly // Repeatedly copy the remaining elements in A1 to A, starting at index i // Repeatedly copy the remaining elements in A2 to A, starting at index j