algorithms please solve it with clear hand write

3. Radix Sort. (a) You are given the following array consisting of 9 elements A = (450,536, 822, 210, 16. 112, 357, 216, 316) (i) (5 points) Use Radix Sort to sort the sequence of elements in A. Show each step of your procedure (ii) (5 points) Suppose that you modified Radix sort so that you start sorting instead the least significant digit (as opposed to starting with the most significant digit). Show the output of this modified variant of Radix sort. Will you get the correct answer? (b) (5 points) If your array A had n integers where the range of each integer is between O and nand you set the size of each digit in an integer to be r = 2 Ign, what is the asymptotic running time of radix sort on A? (Start by finding out what is b, the number of bits to represent any integer)