(a) (8 pts) In QuickSelect algorithm based on the rank of the anchor value we recursively zero in on one of the two sub arrays to find the median value of the original array. Fill in the details of this algorithm (b) (7 pls) The RepeatedSquaring evaluates the power finction a: power(a, n) with time complexity O(leg r Write a recursive or iterative function based on this idea and explain why your function is indeed O(logn (a) (8 pts) In QuickSelect algorithm based on the rank of the anchor value we recursively zero in on one of the two sub arrays to find the median value of the original array. Fill in the details of this algorithm (b) (7 pls) The RepeatedSquaring evaluates the power finction a: power(a, n) with time complexity O(leg r Write a recursive or iterative function based on this idea and explain why your function is indeed O(logn