Q.1: Solve the following recurrence relations using master method. T(n) = 4T(n/2)+n?+ n T(n) = 7T(n/3) + n? T(n) = 2T(n/4) + n12 T(n) = 3T(n/3) + n/log n а. b. с. d.

TRUE OR FALSE N Queens' problem can be effectively solved using dynamic programming.

Solve the recurrence relations shown below. a. T(n)={4T(n−1)+1if n>11if n=1T(n)={4T(n−1)+1if n>11if n=1 -- b. T(n)={3T(n/3)+4nif n>11if n=1

If lim n->oo (f(n))/(g(n)) = 0 then f(n) = ω( g(n) ) true false

can you help explain the question on the attached?

Divide and Conquer Strategy and Asymptotic Notation Use the substitution method to prove that the following recurrence has the solution T(n)=Θ(nlgn). You need to consider both the lower bound and upper bound. The given recurrence is T(n) = T(n/3) + T(2n/3) + Θ(n).

1. How to solve the following recurrence using backward substitution. O T(n) = /2 * T(n/2) + c, for n> 1 T(1) = a 0 (n²) o(n*) O(n log n) O (2")

8. Solve the following recurrence relations. (16 points) a. T(n) = 4T(n-1) + 1 for n > 1; T(1) = 1; b. T(n) = T(n/2) + 3; T(1) = 1; Here you can assume that n=2k for some integer k.

If lim n->oo (f(n))/(g(n)) = 0 then f(n) = ω( g(n) ) true false