Question:
Assume that T(n) = n for n≤2. For the questions below, find
Last updated: 8/4/2022
Assume that T(n) = n for n≤2. For the questions below, find the tightest asymptotic upper bound and show the method you used to obtain it. Show explanation, please. 1) T(n)=(T(n/2))² 2) T(n)=(T(√n))2 3) T(n)=T(2n/3)+log(n)