Problem
1. What is the maximum number of times during the execution of Quicksort that the largest element can be moved?
2. Show how the file AB AB ABA is partitioned, using the two methods suggested in the text.
3. How many comparisons does Quicksort use to sort the keys EASY QUESTI0N?
4. How many "sentinel" keys are needed if insertion sort is called directly from within Quicksort?