3-2. (6 pts) Solve the following recurrence, i.e., obtain 0 - bound using the master method. Show your work (specify a,
Posted: Wed Apr 27, 2022 3:36 pm
3-2. (6 pts) Solve the following recurrence, i.e., obtain 0 - bound using the master method. Show your work (specify a, b, epsilon, c when they are applied). T(n) = 9 T(n/3) + 7n2 0=9, 6:3, f(n)=?n? sok+2. log, a = 100,3 = 0.5=1 1926 <k, so Case 3, TCN) - Offen)) - ☺ (n²) T(n)