Find an exact formula for the number of lines needed to be run in both the insertion sort and merge sort pseudo-code. This formula should be for arrays of size n that are in the reverse of sorted (e.g. [8, 7, 6, 5, 4, 3, 2, 1] with n = 8). Give the ranges of n where merge sort performs better than insertion sort. For full points, you cannot use a recursively defined function for merge sort.

TopDownMerge (A], iBegin, iMiddle, iEnd, B[) i = iBegin, Merge sort IWILL Le tiere are e lements in the teft or right runs... for (k= iBegin; k 1End ; k++) { 1If left run head exists and isexisting right run head. } else t B[k] = A[j]; Insertion sort while i = and A[j] > x end while i-i+1 end while