Thanks!

Q16. Approximately, how many comparisons will quicksort make when sorting an array of N items that are all equal? Q17. A sorting algorithm is said to be stable if two objects with equal keys appear in the same order in sorted output as they appear in the input array to be sorted. Which one of the following sorts is unstable? a. Merge sot b. Insertion sort c. Shell sort d. In-place Merge Sort e. None of the above Q18. As with most recursive algorithms, an easy way to improve the performance of the recursive version of Merge sort is: a. Cut off to insertion sort, when the size of the sub-arrays (to be merged) is small b. Cut off to selection sort, when the size of the sub-arrays (to be merged) is small Page 3 of 4 c. Apply quick sort to sub-arrays with