chap lower bounds write the complete algorithm for the merge insert sort sketched out in section here is suggestion for what might be truly optimal sorting algorithm pick the best set of comparisons for input lists of size then pick the best set of comparisons for size size size and so on combine them together into one program with big case statement is this an algorithm projects implement the median-finding algorithm of section thenmodify this algorithm to allow finding the ith element for any value