Imagine that there exists an algorithm SPLITk that can split a list L of n elements into k sublists, each containing one or more elements, such that sublist i contains only elements whose values are...

Imagine that there exists an algorithm SPLITk that can split a list L of n elements into k sublists, each containing one or more elements, such that sublist i contains only elements whose values are less than all elements in sublist j for i <><=><>

(a) What is the worst-case asymptotic running time for SORTk? Why?  (b) What is the average-case asymptotic running time of SORTk? Why?