Suppose in a merge-sort of n data points, the recursive division is stopped when any sub array size becomes k. Then each of the (n/k) sub-arrays is sorted by insertion sort. After the sorting of the (n/k) sub arrays, each of size k, the typical merge-sort procedure is followed. Comment on the complexity of the combined algorithm and justify your answer.