How many comparisons would you expect to be performed by Quicksort if we are lucky and always pick the median element as the pivot. You only need to consider the case when n10. You should draw a recursion tree and note how many comparisons are performed at each subproblem. (worth 4 points) 1