7. The performance of the merge operation for n items in merge sort is a. O(log n) b. O(n) c. O(n log n) d. O(n) 8. In quick sort, the partition step takes at mostcomparisons for n items a. n b. n/2 c. 2n d. logn 9. The best-case performance of quick sort for n items is a. Oflog n) b. O(n) c. O(n log n) d. O(n? 10. The worst-case performance of radix sort on restricted data is a. Ollog n) b. O(n log n) c. 0(n2) d. O(n) e. None of the above 13- Given the following maxheap, assuming heap entries start at index 1, show the heap after adding the entry 87 using the array representation. 12 24