22. What is the best-case asymptotic running time of binary search on a sorted array A containing n elements? 23. What is the worst-case asymptotic running time of QuickSort on an array A containing n elements? 24. True or false: the running time of the Partition function in QuickSort is linear in the size of the subproblem 25. Suppose that 47.2% of the time the Partition function in Quicksort chooses a pivot element that is the median of the particular subproblem it is sorting, while the other 52.8% of the time, it chooses the minimum value. What would be the asymptotic running time of QuickSort in this case? 26. Using the input array A 9,7,5, 11, 12,2, 14,3, 10,6] and the QuickSort algorithm, what is the number of times a comparison is made to the element with value 3. (As sume the partition algorithm always chooses the last element as the pivot. 27. True or false: Divide and conquer algorithms only work when a problem has optimal substructure. 28. True or false: The standard way to prove the correctness of a divide and conquer algorithm is through a loop invariant