Prove the following statements: m-1 (i) For any 0 i! i=0 (ii) log(n!) = O(n log n). (Hint: Use Sterling's approximation for n!.) = Use recursion-trees to solve the recurrence f(n) = 2f(n/2)+n, when n 2k for any k > 1