Consider the recurrence T(n). T(n) = {c if n = 1 2T((n/4) + 16 if n > 1 1. Use the recursion tree or repeated substitution method to come up with a good guess for a bound g(n) on the recurrence T(n). 2. State and prove by induction a theorem showing T(n) element of O(g(n)). 3. State and prove by induction a theorem showing T(n) element of Ohm (g(n))