6. (a) (5 points) Suppose we are given a sequence S of n elements, each of which is an integer in the range [0,n2-1. Describe a simple method for sorting S in O(n) time. [Hint: think of alternative ways of viewing the elements b) (3 points) Does the running time of radix-sort depend on the order of keys in the input? Explain