Q(2) Quicksort with equal element values: The analysis of the expected running time of randomized quicksort in Section 7.4.2 assumes that all element values are distinct. In this problem, we examine what happens when they are not Suppose that all element values are equal. What would be randomized quicksort's running time in this case? (Problem 7-2 (a)) Hint: Analyze algorithm PARTITION first, then QUICKSORT.Define the recurrence condition under the new assumption and then solve it 03) Where in a max-heap might the smallest element reside, assuming that all elements are distinct? Exercise 6.1-4) Hint: Analyze the BuildHeapO algorithm then use loop invariant to prove your answer by induction