(Solved): Consider the pseudocode description of an implementation of the merge sort algorithm below.Given th ...

Algorithm: merge(data $[0?n?1]$, first $[0?(n?1)/2]$, second $[0?n?(n?1)/2?2])$ Input: data - the array of size $n$ first - contains $(n?1)/2+1$ sorted elements second - contains $n?(n?1)/2?1$ sorted elements Result: The array data is sorted. iFirst $?0$ iSecond $?0$ $\mathbf{j}?0$ while ifirst < size1 AND iSecond < size2 do if first [iFirst] < second[iSecond] then data[j] $?$ first [iFirst] iFirst $?$ iFirst +1 else data $[\mathrm{j}]?$ second[iSecond] iSecond $?$ iSecond +1 end $\mathbf{j}?\mathbf{j}+1$ end rangeCopy(first,iFirst,data,j,(n-1)/2+1-iFirst) rangeCopy(second,iSecond,data,j,n-(n-1)/2-1-iSecond) Algorithm 2: Merge Two Sorted Halves into data Algorithm: mergeSort(data[0 $?n?1])$ Input: data - the array to be sorted Result: The elements of data are in non-decreasing order. if size $>1$ then $\mathrm{mid}?(n?1)/2$ first $?$ allocate(mid+1) second $?$ allocate $([n?$ mid-1]) rangeCopy(data, 0 ,first, 0, mid+1) rangeCopy(data,mid+1,second,0,n-mid-1) mergeSort(first, mid+1) mergeSort(second,n-mid-1) merge(data,first,second) deallocate(first) deallocate(second) end Algorithm 1: Copies data into Two Arrays - $f$ irst and second A. After the third call to merge, the first entry of first is the last entry of first is , the first entry of second is the last entry of second is the first entry of data is and the last entry of data is B. After the fifth call to merge, the first entry of first is the last entry of first is , the first entry of second is the last entry of second is , the first entry of data is and the last entry of data is C. After the seventh call to merge, the first entry of first is , the last entry of first is , the first entry of second $\mathrm{i}$ the last entry of second is the first entry of data is , and the last entry of data is D. After the ninth call to merge, the first entry of first is the last entry of first is the first entry of second is the last entry of second is the first entry of data is , and the last entry of data is