 To calculate the span of the algorithm, it is necessary to derive a Recurrence relation.Since the two recursive calls of "merge" are in parallel, only the costlier of the two calls needs to be considered.In the worst case, the maximum number of elements in one of the recursive calls is at most formula_1 since the array with more elements is perfectly split in half.