(a) CLRS 8.3-1Using figure 8.3 as a model, illustrate the operation of Radix-Sort on the following list of English words: COW, DOG, SEA, RUG, ROW, MOB, BOX, TAB, BAR, EAR, TAR, DIG, BIG, TEA, NOW, FOX.

(b) CLRS 8.4-1Using figure 8.4 as a model, illustrate the operation of Bucket-Sort on the array A =< .79, .13, .16, .64, .39, .20, .89, .53, .71, .42 >.

(c) Explain why the worst-case running time for bucket sort is (n 2 ). What simple change to the algorithm preserves its linear average-case running time and makes its worst-case running time O(n lg n).