Merge sort algorithm is  ________, the worst case time complexity of sorting an array containing N elements with merge sort is               . Group of answer choices unstable, O(NlogN) stable, O(NlogN) stable, O(N2) unstable, O(N2)

These statements all describe which the sort algorithm? It is an in-place sorting algorithm. • It can sort a list of data elements considerably faster than many other sorting algorithms. • It selects an element in the array to divide the array into subarrays. ● The relation order of equal sort items is not upheld. 0000 Merge Sort Radix Sort Quick sort External Sort

Which sorting algorithm is O(n2) even in the best case?a. quicksort b. merge sort c. selection sort d. insertion sort