Can you help me with this Java program on sorting? Please add necessary comments!

Sorting and Searching Part A Sorting In the first part of this assignment, you will implement a radix sort algorithm. Radix sort does not use direct key comparison to arrange data. Instead, repeated passes are made over the data and a selected piece of each data item is used to order the data The following example illustrates the process using binary data. The radix sort begins by examining the least significant digit (LSD) of each item. The digit is extracted and the data set is divided into two bins (for radix 2, bin 0 and bin1) based on the value of the least significant digit. After separating all the data items into the two bins, the content of the bins is combined (elements in bin 0 followed by elements in bin1) and the process is repeated for next most significant digit. This process is repeated until all the digits are examined. Study the example shown below. The sorted data set appears in the rightmost column. 01 i0300 He9100 Your task is to develop a radix sort function and test program that takes an unsorted array of positive integer values and sorts the data using a radix sort. Your program must have the following features: Inside main, create the array of size 100 and fill it with random numbers between 0 and 10000. Create a radix sort function (this will be a static method within your test program) that takes the array to be sorted as a parameter. Use Create the storage needed based on the value of the radix... for o Calculate the number of digits the max value from the array radix 10 for your sort function. radix 10, you need 10 buckets.. contains using the radix as a base. This will determine the le. 942 base 10 has 3 digits.... The base (10) raised to the 3d o For each digit, least significant to most significant, map the o After splitting into buckets, copy the values from the buckets number of times your outer loop will execute. power is the smallest power larger than the number numbers from the array into the buckets based on the digit back into the original array o When the outer loop has completed, the array will be sorted Display the contents of the array before and after sorting (10 values per line). Verify that the data is properly sorted