Need help answering these 3 parts for my intro to algorithms course.

A) Show how to sort n integers in the range 0 to n³ - 1 in O(n) time.

B) Suppose we use RANDOMIZED-SELECT to select the minimum element of the array A = (3, 2, 9, 0, 7, 5, 4, 8, 6, 1). Describe a sequence of partitions that results in a worst-case performance of RANDOMIZED-SELECT.

C) Show how quicksort can be made to run in O (n lg n) time in the worst case, assuming that all elements are distinct.