IN JAVA

Please answer if you know it. Dont say "no idea" or "i do not know" in the comments that will only force me to edit the question otherwise chegg will take it down because the "expert" "needs clarification" .

Overview One of the most important ADTs is the Dictionary and one of the most studied problem is sorting. In this assignment, you will analyze multiple implementations of sorting algorithms. Write a program to perform analysis on various sorting algorithms utilizing 4 different data types. Sorting algorithms code is provided with this assignment. Create and submit a report discussing the analysis at each iteration. Clearly define your approach, challenge and assessment. ArraySize 50K elements Comparisons Movements Total Time Experimental Results List Property: InOrder Insertion Sort Selection Sort Quick Sort Merge Sort Heap Sort Radix Sort Total Time List Property: Reverse Order Comparisons Movements Insertion Sort Selection Sort Quick Sort Merge Sort Heap Sort Radix Sort Comparisons Movements Total Time List Property: AlmostOrder Insertion Sort Selection Sort Quick Sort Merge Sort Heap Sort Radix Sort Total Time List Property: RandomOrder Comparisons Movements Insertion Sort Selection Sort Quick Sort Merge Sort Heap Sort Radix Sort 1 Project 1 - Sorting Algorithm (Rubric) Experimental Results (per data type per sorting algorithm) Comparisons Movements Points 5 5 Total 30 30 2 GUI / UI (Optional - see Bonus) Per Data 3 Winning Algorithm Type 4 16 4 Per Data Analysis Report Type Total Points without Bonus 6 24 100 5 5 5 Bonus Creativity 1 (Per the discretion of the grader) Creativity 2 Creativity 3 GUI/UI Total Points with Bonus 5 10 25 Note: creativity means going above and beyond the requirement of the assignment. Any ideas or implementation to show the central idea of the assignment. Overview One of the most important ADTs is the Dictionary and one of the most studied problem is sorting. In this assignment, you will analyze multiple implementations of sorting algorithms. Write a program to perform analysis on various sorting algorithms utilizing 4 different data types. Sorting algorithms code is provided with this assignment. Create and submit a report discussing the analysis at each iteration. Clearly define your approach, challenge and assessment. ArraySize 50K elements Comparisons Movements Total Time Experimental Results List Property: InOrder Insertion Sort Selection Sort Quick Sort Merge Sort Heap Sort Radix Sort Total Time List Property: Reverse Order Comparisons Movements Insertion Sort Selection Sort Quick Sort Merge Sort Heap Sort Radix Sort Comparisons Movements Total Time List Property: AlmostOrder Insertion Sort Selection Sort Quick Sort Merge Sort Heap Sort Radix Sort Total Time List Property: RandomOrder Comparisons Movements Insertion Sort Selection Sort Quick Sort Merge Sort Heap Sort Radix Sort 1 Project 1 - Sorting Algorithm (Rubric) Experimental Results (per data type per sorting algorithm) Comparisons Movements Points 5 5 Total 30 30 2 GUI / UI (Optional - see Bonus) Per Data 3 Winning Algorithm Type 4 16 4 Per Data Analysis Report Type Total Points without Bonus 6 24 100 5 5 5 Bonus Creativity 1 (Per the discretion of the grader) Creativity 2 Creativity 3 GUI/UI Total Points with Bonus 5 10 25 Note: creativity means going above and beyond the requirement of the assignment. Any ideas or implementation to show the central idea of the assignment