1 Sandra has a bright idea: When the length of a sublist in quicksort is less than a certain number—say, 30 elements—run an insertion sort to process that sublist. Explain why this is a bright idea.
2 Why is merge sort an O(n log n) algorithm in the worst case?
3 What is meant by the first and the rest of a Lisp-like list?
4 Define a function insert that expects an index, an item, and a Lisp-like list as arguments. The function returns a list in which the item is inserted at the given index position
