use recursion tree or subsitution to come up with a tightbound
10. (10 points) Consider the recurrence T(n). if n s 1 Use recursion trees or repeated substitution to come up with a tight bound for T(n). Show transcribed image text 10. (10 points) Consider the recurrence T(n). if n s 1 Use recursion trees or repeated substitution to come up with a tight bound for T(n).
Answer
