please solve this

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.