4. Median of Medians Algorithm (a) (b) (c) Illustrate how to apply the QuickSelect algorithm to find the k 4th smallest element in the given array: A = [5, 3, 4, 9, 2, 8, 1, 7, 6] by showing the recursion call tree. Refer to Sams Lecture 10 for notes on QuickSelect algorithm works Explain in 2-3 sentences the purpose of the Median of Medians algorithm. Consider applying Median of Medians algorithm (A Deterministic QuickSelect algorithm) to find the 4th largest element in the following array: A = [6, 10, 80, 18, 20, 82, 33, 35, 0, 31, 99, 22, 56, 3, 32, 73, 85, 29, 60, 68, 99, 23, 57, 72, 25).Illustrate how the al- gorithm would work for the first two recursive calls and indicate which sub array would the al- gorithm continue searching following the second recursion. Refer to Rachel's Lecture 8 for notes on Median of Medians Algorithm 4. Median of Medians Algorithm (a) (b) (c) Illustrate how to apply the QuickSelect algorithm to find the k 4th smallest element in the given array: A = [5, 3, 4, 9, 2, 8, 1, 7, 6] by showing the recursion call tree. Refer to Sams Lecture 10 for notes on QuickSelect algorithm works Explain in 2-3 sentences the purpose of the Median of Medians algorithm. Consider applying Median of Medians algorithm (A Deterministic QuickSelect algorithm) to find the 4th largest element in the following array: A = [6, 10, 80, 18, 20, 82, 33, 35, 0, 31, 99, 22, 56, 3, 32, 73, 85, 29, 60, 68, 99, 23, 57, 72, 25).Illustrate how the al- gorithm would work for the first two recursive calls and indicate which sub array would the al- gorithm continue searching following the second recursion. Refer to Rachel's Lecture 8 for notes on Median of Medians Algorithm