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?

After making a powerpoint presentation about a new line of clothing designs, henri notices that he used the word “gorgeous” on nearly every slide. what would be the  best  way to add more variety to his wording by using tools within powerpoint? using the thesaurus under the view tab, and then using the find dialog box to find and replace every instance of “gorgeous”using the spelling checker under the view tab, and then using the find dialog box to find every instance of “gorgeous” and change some of themusing the thesaurus under the review tab, and then using the find dialog box to find every instance of “gorgeous” and change some of themusing the spelling checker under the review tab, and then using the find dialog box to find and replace every instance of “gorgeous”