using java

1)The radix sort algorithm sorts an array of n integers with d digits, using ten auxiliary arrays. First, pad each integer with 0s on the left so that all n integers have the same number of digits. Then, to sort the integers:

-Place each value v into the auxiliary array whose index corresponds to the last digit of v.

-Move all values back into the original array, preserving their order.

-Repeat the process, now using the next-to-last (tens) digit, then the hundreds digit, and so on.

Trace a walkthrough of radix sort with these lists: a. 5 11 7 3 5 4 7 11 4 9 b. 9 0 11 10 5 8 9 6 8 7 5

2)A stable sort does not change the order of elements with the same value. This is a desirable feature in many applications. Consider a sequence of e-mail messages. If you sort by date and then by sender, youd like the second sort to preserve the relative order of the first, so that you can see all messages from the same sender in date order. Is selection sort stable? Insertion sort? Why or why not?