For each of the following recurrence relations use recursion trees or the repeated substi- tution method to guess a tight bound and then use induction to prove upper and lower bounds. c)