2 Solve the following recurrence relation. (4f (1) + 0(n), n > 1 f(n) = [3M] 0(1), n = 1 b. Apply the master method to d
Posted: Mon Jul 11, 2022 9:49 am
2 Solve the following recurrence relation. (4f (1) + 0(n), n > 1 f(n) = [3M] 0(1), n = 1 b. Apply the master method to determine the asymptotic behavior of the function T(n). [1+1=2M] i. T(n) = 2T(n/4) +0.51 ii. T(n) = 0.5T(n/2) +1/n