1. Show the order of the steps to sort {3, 1, 4, 1, 5, 9, 2, 6} using Mergesort algorithm.
2. Show the element sequences of running Shellsort on the input {9, 8, 7, 6, 5, 4, 3, 2, 1} at the increments {7, 3, 1}, respectively.
3. Show the steps in details of sorting {3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5} using quicksort with median-of-three partitioning and a cutoff 3 (if the elements are less than 3, using insertion sort).