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

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 time complexity for executing merge sort on an array of size n which is already sorted isSelect one:O(n log n)O(log n)OO(n^2)

What is the run time of Merge Sort algorithm in terms of Big O? a. O(logN) b. O(N) c. O(N!) d. O(NlogN) e. O(N^2)

What is the worst case time complexity of mergesort

Select the correct answerWhat is the worst case time complexity of a quick sort algorithm?OptionsO(N)O(N^2)O(log N)O(N log N)