illustrate the operation of Partitio I. (Basic) Using Figure 7.l as a model, i n on the array 2. (Basic) Is Quick-Sort an in-place sorting algorithm? How about Merge sort, Heap sort, 3. (Basic) The running time of Randomized-Quicksort that picks the pivot uniformly at ran- 4. (Basic) The running time of Randomized-Quicksort that picks the pivot uniformly at ran- 5. (Basic) The running time of Randomized-Quicksort that picks the pivot uniformly at ran- A (13, 19,9,5, 12,8,7,4,21,2) Insertion sort? dom is always O(n log n) for any input of size n. True of False? dom is O(n log n) in expectation for any input of size n. True of False? dom is always (n log n) for any input of size n. True or False