Give ezact numerical answers to each of the following questions related to sorting. a. What is the number of comparisons for merge sort when sorting 5 elements that are initially in sorted order? Assume the first half of a list with odd-length n has (n - 1)/2 elements. b. What is the worst case number of comparisons for the best (theoretically) pos- sible comparison-based sorting algorithm when sorting any 5 elements? c. What is the worst case number of comparisons for Quicksort when sorting any 5 elements? d. What is the number of comparisons required by Heapsort when sorting 5 ele- ments that are initially in reverse order?" e. What is the worst case number of comparisons for merge sort when sorting any 5 elements