Consider a "strange version" of merge sort in which we divide the array at the middle for the first k levels of the recursion tree (k is a parameter to the function), and then use insertion sort to sort the sub-arrays at that level, and then go back up the tree, merging, just like before. what is the running time, in theta notation, for this strange algorithm?