Thanks!

Q11. How many merge routines will be carried out for a list of 41 items? a. 3 b.4 c. 5 d. 6 e. 7 f. None of a-e Q12. Which of the following statements is true? a. Selection sort a best case order of N? while Shell sort (3x+1) has an unknown average case order b. Insertion sort a best case order of N? while Shell sort (3x+1) has an unknown average case order C. Selection sort a worst case order of Na while Shell sort (3x+1) has a worst case order of N2 d. Insertion sort an average case order of N2 while Shell sort (3x+1) has best case order of NlogN e. None of the above Q13. Any comparison based sorting algorithm, sorting N items, must use at least: Page 2 of 4 a. log(N!) comparisons, in the worst case b. logn comparisons, in the worst case c. log(logn) comparisons, in the worst case d. N comparisons, in the worst case e. Na comparisons, in the worst case