Advanced Algorithm

. Use recursion tree method to prove that T(n) = T(n-1) + O(n) is O(n²) (Note: Quicksort Worst-case)

. Use recursion tree method to prove that T(n) = 2T(n/2) + O(n) is O(n lg n) (Note: Quicksort Best-case)