5. Using the definition of Big- notation, show that the runtime T(n)3n3 +2n lg(n) is e (n3). Hint: look at how it is done for Big-0, and do the same for 2. 6. In book (Chap 1) we saw the theorem: T n(n+)(2n+1) With induction, prove that this theorem is true for any natural number 2 1. Hint: Establish base case, then assume true for k, prove for k+1