3. Radix Sort. You are given the following array consisting of 9 elements A (560, 647,933, 27, 123,468, 320, 327, 427) (a) (5 points) Use Radix Sort to sort the sequence of elements in A. Show each step of your procedure. (b) (5 points) Suppose that you modified Radix sort so that, instead of using counting sort as the auxiliary sorting algorithm, it would now use quicksort to sort each digit. Show the output of this modified Radix sort algorithm when given A as input. Is it correct? c) (5 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? 3. Radix Sort. You are given the following array consisting of 9 elements A (560, 647,933, 27, 123,468, 320, 327, 427) (a) (5 points) Use Radix Sort to sort the sequence of elements in A. Show each step of your procedure. (b) (5 points) Suppose that you modified Radix sort so that, instead of using counting sort as the auxiliary sorting algorithm, it would now use quicksort to sort each digit. Show the output of this modified Radix sort algorithm when given A as input. Is it correct? c) (5 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