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

What is the best-case time complexity of Merge Sort?Group of answer choicesO(n log n)O(n)O(log n)O(n^2)

The efficiency of the Insertion Sort is O(N2) where N is the size of the list being sorted.Group of answer choicesTrueFalse

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

Which sorting algorithm works by repeatedly dividing the unsorted list into two halves and merging them back together?Group of answer choicesInsertion SortMerge SortBubble SortSelection Sort

Which of the following sorting algorithms can be used to sort a linked list in O(n log n) time?Group of answer choicesInsertion sortBubble sortMerge sortQuick sort