Problem # 7 %-% Mergesort suppose that instead of this: splitting in equal halves we split them 1ike one group with of the elements The other group with the remaining %. include n-2 because a -5 split of 2 elements will not "make progress"). Otherwise, the algorithm is the same as regular MergeSort. (A) Write a recurrence relation expressing the runtime of this version of Mergesort. (B) Analyse your recurrence relation (e.g., using a recursion tree) to derive a tight (Big-) runtime bound for this version of MergeSort