In Java The radix sort algorithm sorts an array of n integers using ten auxiliary arrays. First place each value v into the auxiliary array whose index corresponds to the last digit of v. Then 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. Implement the radix sort algorithm to sort arrays of integers. For simplicity, you can assume the integers are all positive and between 0 and 9999.

The numbers should be loaded from the provided sample file numberlist.txt.