I have all the algorithms for the sorting methods (insertion sort, selection sort, etc.), and I know how to get the comparisons and movements. However, I'm stuck on how to make the array list follow the different list properties (InOrder, ReverseOrder, AlmostOrder, and RandomOrder)? The last picture is what the output is supposed to look like.

Please do not copy from other answers. Thank you!

Purpose: Analysis of Sorting Techniques 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. insertionSort.java, selectionSrot.java, quicksort.java, HeapSort.java, RadbxSort.java, and MergeSort.java files are provided with this assignment. Create and submit a report discussing the analysis at each iteration. Clearly define your approach, challenges, and assessment. \begin{tabular}{|l|l|l|l|} \hline Experimental Results & ArraySize & 50K elements \\ \hline List Property: InOrder & Comparisons & Movements & Total Time \\ \hline Insertion Sort & & & \\ \hline Selection Sort & & & \\ \hline Quick Sort & & & \\ \hline Merge Sort & & & \\ \hline Heap Sort & & & \\ \hline Radix Sort & & & \\ \hline \end{tabular} \begin{tabular}{|l|l|l|l|} \hline List Property: ReverseOrder & Comparisons & Movements & Total Time \\ \hline Insertion Sort & & & \\ \hline Selection Sort & & & \\ \hline Quick Sort & & & \\ \hline Merge Sort & & & \\ \hline Heap Sort & & & \\ \hline Radix Sort & & & \\ \hline \end{tabular} \begin{tabular}{|l|l|l|l|} \hline List Property: AlmostOrder & Comparisons & Movements & Total Time \\ \hline Insertion Sort & & & \\ \hline Selection Sort & & & \\ \hline Quick Sort & & & \\ \hline Merge Sort & & & \\ \hline Heap Sort & & & \\ \hline Radix Sort & & & \\ \hline \end{tabular} \begin{tabular}{|l|l|l|l|} \hline List Property: RandomOrder & Comparisons & Movements & Total Time \\ \hline Insertion Sort & & & \\ \hline Selection Sort & & & \\ \hline Quick Sort & & & \\ \hline Merge Sort & & & \\ \hline Heap Sort & & & \\ \hline Radix Sort & & & \\ \hline \end{tabular} Non-Graphical User Interface 1. InOrder 2. ReverseOrder 3. AlmostOrder 4. Random Order List Properties, select the data type of list you wish to use: 4 1. 5000 2. 15000 3. 50000 Input Size, select the size of list: 2 1. Insertion Sort 2. Selection Sort 3. Quick Sort 4. Merge Sort 5. Heap Sort 6. Radix Sort Sorting Algorithm, select the sorting algorithm: 1 Experimental Results: Input Size: 15000 Data Type: Random Order Sort: Insertion Comparisons: 116823255 Movements: 45855 Total Time: 230