How can you achieve efficient sorting of large datasets with minimal memory usage using the Comparable interface? Discuss strategies and trade-offs.

Compare the sorting durations of the insertion sort and QuickSort using a tiny array (less than 20). What is the time difference? Could you clarify why? Compare the sorting durations of the insertion sort and QuickSort using a tiny array (less than 20). What is the time difference? Could you clarify why?Compare the sorting durations of the insertion sort and QuickSort using a tiny array (less than 20). What is the time difference? Could you clarify why?

What is the average-case running time for Merge Sort and Quick Sort, respectively? Why do we prefer Quick Sort algorithm in practice? Please  provide at least two benefits of Quick Sort and also provide explanations for each benefit (plain language explanation is fine).

Sorting Algorithms 1. Add a counter to the functions insertionSort and mergeSort that counts the number of comparisons that are made. Run two functions with arrays of various sizes. At what size does the difference in the number of comparisons between significant? How does this size that the orders of these algorithms predict? Compare your analysis with the actual running times and counter as a function of the input size n = 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 8192, 16384 <time.h> and clock() function.) Use the below code to generate an array value for testing.            for (int i = 0; i < n; i++)             {                   //Create an unsorted array                   arr[i] = (double)(n - i);                               }