elements You are given the following array consisting of 9 A = (536, 822, 16, 012, 357, 210, 216, 316, 450) (a) (5 points) Use Radix Sort to sort the sequence of elements in A. Show each step of your procedure. (b) (3 points) Suppose that you modified Radix sort so that, instead of sorting from the least significant digit first (right-to-left), it would start sorting from the most significant. digit (left-to-right). Show the output of this modified Radix sort algorithm when given A as input. Is it correct? (c) (2 points) Show how you can sort any n integers in the range [1,..., n] in time O(n). Explain why your solution is linear time.