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 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 average run time of Quick Sort algorithm in terms of Big O? a. O(logN) b. O(N!) c. O(NlogN) d. O(N^2) e. O(N)

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)

What is the worst case time complexity of mergesort

Which sorting algorithm is faster between merge sort and heap sort, despite having the same asymptotic run times? Merge sort Heap sort They have equal performance It depends on the input data