1. Assume you execute quicksort. Assume it turns out that at the odd levels of recursive calls you get medium lucky and partition on the [n/4]th smallest element. At the even levels you get very lucky and partition on the median element. For example, let's say n = 5. The first pivot will be at index 2, leaving arrays of sizes 1 and 3. It will take four comparisons. The size 1 array will take no more comparisons. In the size 3 array you will pivot on median (i.e. second) element, giving two more comparisons. Overall, this will take 4 + 2 = 6 comparisons. Analyze how many comparisons this lucky version of quicksort does. Just get the exact value for the high order term. You do not have to worry about floors and ceilings and you can make reasonable simplifying assumptions. 1. Assume you execute quicksort. Assume it turns out that at the odd levels of recursive calls you get medium lucky and partition on the [n/4]th smallest element. At the even levels you get very lucky and partition on the median element. For example, let's say n = 5. The first pivot will be at index 2, leaving arrays of sizes 1 and 3. It will take four comparisons. The size 1 array will take no more comparisons. In the size 3 array you will pivot on median (i.e. second) element, giving two more comparisons. Overall, this will take 4 + 2 = 6 comparisons. Analyze how many comparisons this lucky version of quicksort does. Just get the exact value for the high order term. You do not have to worry about floors and ceilings and you can make reasonable simplifying assumptions