I need to solve this asap, please help me with this I only have few hours for this, below it I will also attach lecture slides

below this I'm attaching lecture slides

these are end of slides. please help me in doing this I'm posting this for the second time

Cutoff to insertion sort Implement quicksort with a cutoff to insertion sort for subarrays with less than M elements, and empirically determine the value of M for which quicksort runs fastest in your computing environment to sort random arrays of N doubles, for N= 103, 104, 105, and 106 Plot average running times for M from 0 to 30 for each value of M Note : You need to add a three-argument sort() method to Algorithm2.2 for sorting subarrays such that the call Insertion.sort (a, lo, hi) sorts the subarray a[lo..hi] Min itenm Each larger entry to it's left 4th elements it's the incremnt na an element to 10 anelentmailave r from 0 Save er from 0