How many comparisons and interchanges (in terms of Tile si/e a) are performed by (a) Simple insertion sort and (b) Shell Sort using increments 2 and 1 for the following files: A sorted file Afile that K sorted inreverseorder (that is, from largest to smallest) A file in which |0|, x|2|, x|4|... are the smallest elements in sorted order, and in sshich x| 11|. x131. x|5|... and the largest elements in sorted order Determine which of the following sorts is most efficient: simple insertion sort straight selection sort bubble sort Determine the number of comparisons (as a function of n and m) that are performed in merging two ordered files a and b of sizes n and m. respectisels. by the merge method presented in the lecture, on each of the following sets of ordered files: m=n and a|i| lessthanb|i| lessthana|i+l| m-n and a|n| lessthanb|l| | i | refers the value in position i of file a. etc. Determine the number of comparisons (as a function of n and m) that are performed in merging two ordered files a and b of sizes n and m. respectisels. by the merge method presented in the lecture, on each of the following sets of ordered files: m-n and a|n/2| lessthanb|l| lessthan b|m| lessthana|(n'2)+l| m=l and b|l| lessthan a|l| m-1 and a|n|