2) (20 points) Develop an induction-based recursive algorithm to find the average of n real numbers A[1..n], n21 3) (12 points) Express the time complexity of Algorithm RADIXSORT in terms of n when the input consists of n positive integers in the interval C. 4) (10 points) Assume that the SELECT algorithm is modified such that the array is divided into groups of size 3, instead of groups of size 5. Investigate whether the O(n) time complexity bound can be achieved in this case, proving your