Select the correct answerWhat is the base case in the Merge Sort algorithm when it is solved recursively?Optionsn=0An empty listA list of length onen=1

What is the base case in the Merge Sort algorithm when it is solved recursively?

Select the correct answerWhich of the following sorting algorithm does not use recursion?Optionsquick sortheap sortbottom up merge sortmerge sort

Which of the following sorting algorithm does not use recursion?Optionsmerge sortquick sortheap sortbottom up merge sort

The efficiency of the Merge Sort is O(Nlog2N), where N is the size of the list being sorted.Group of answer choicesTrueFalse

Given the following list of numbers: [21, 1, 26, 45, 29, 28, 2, 9, 16, 49, 39, 27, 43, 34, 46, 40] which answer illustrates the list to be sorted after 3 recursive calls to mergesort? Select one: a. [21,1] b. [16, 49, 39, 27, 43, 34, 46, 40] c. [21] d. [21, 1, 26, 45]