Part1: Radix Sort.
This project has three sub-tasks demonstrating the Radix Sort:
• Write the complete algorithm for Radix Sort (with counting sort) in JAVA, including individual digit
sorting.
• Implement the algorithm by taking a random array as input, where the
largest number has four (4) digits and the smallest number has two (2)
digits.
• Analyze the loop invariants and complexity of the written algorithm.