Consider the recurrence T (n). 5. 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). You do not need to prove your guess correct. Consider the recurrence T (n). T (n) = {c if n = 0 2T ([n/4]) + 2 Squareroot n if n > 0 6. 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). You do not need to prove your guess correct