How many comparisons would you expect to be performed by Quicksort if we are unlucky and we always pick the minimum or maximum element as the pivot. Consider the case when n10. You should draw a recursion tree and note how many comparisons are performed at each subproblem. (worth 4 points) 2