Let MergeSort3 be an algorithm that performs Merge Sorting inthe traditional sense except for it breaks the array up into threeparts instead on two, thus it also performs at n log(n).MergeSort_k is described below, what steps are problematic for theruntime assumptions, and why doesn’t it meet this assumption? Whatis the actual Big-O runtime?
PayPal Gateway not configured
PayPal Gateway not configured