Consider the following variation on merge sort for the large values of 'n 'instead of recursing until 'n' is sufficiently small recur atmost a constant 'r' times and then use insertion sort to solve the 2r resulting sub problems.What is the running time of this variation
a)theta(n)
b)theta(n log n)
c)theta(n2)
d)theta(log n)