with a 9 to 1 proportional split at every level of recursion, which intuitively seems quite unbalanced, quicksort runs in o(n lg n) false true this is unbalanced, therefore n^2 runtime none of the answers is correct