Please give detailed steps. Thank you!

4. Solving the following recurrences (4 points) Use the Substitution Method for solving the following recurrences. 1. Show that the solution of T(n) = T(n 1) +n is O(n2). 2. Show that the solution of T(n) = T([]+1) is O(Ign). Note: [] is ceiling. Ign Is log base 2