Question 7 3 Points Even though the worst case computing time for Merge Sort Algorithm is on log n), whereas the worst case computing time for Quick Sort Algorithm is (n2), in practice Quick Sort out performs Merge Sort, why? A The way quick sort is written, it saves time by reducing comparisons due to extra element added at the end. B In quick sort no merging is required after partitioning. The best case for the Quick Sort is very efficient and it occurs very often. D) Merge sort requires copying the elements of the array into additional arrays. Question 8 10 Points Given a sorted array of distinct integers A[O...n-1), Write an efficient algorithm based on divide and conquer strategy that finds out whether there is an index i for which A[i] = i, if so, return index i, else return -1. Your algorithm should run in time O(log n). Use the editor to format your