Please also provide the queue class as well.

Use class Queue. java you developed in part I above to implement the Radix Sort algorithm using queues. Call the program RadixSort. java. The program prompts the user to enter 6 integer numbers and store them in an array that stores integers (call it inputs). The program applies radix sort to the values stored in the array and then prints out the content of array inputs before and after being sorted. For example, if the user entered the numbers 213, 3465, 7, 29, 541, 45, the program output would be as follows: Notice that we are using ONLY one array, and your need 10 queue objects to implement radix sort. See class notes. For digit extraction required for radix sort, implement a separate method in class RadixSort (call it ExtractDigit (...)) to do this function. See class notes on how to do digit extraction