

Solve the following recurrences using substitution. (n)T(n 2)3n + 4,for all n 2 3. G iven...
solve these recurrences using backward substitution method: a- T(n)=T(3n/4)+n b-T(n) = 3 T(n/2) +n
Question 6 (20 points) Solve the following recurrences using the Master Theorem. T(n) = 2T (3/4)+1 T(n) = 2T (n/4) + va 7(n) = 2T (n/4) +n T(n) = 2T (3/4) + n
3. Solve the follwoing recurrences using the master method. (a) T(n) = 4T (n/2) + navn. (8 pt) (b) T(n) = 2T (n/4) + n. (8 pt) (c) T(n) = 7T(n/2) +n?. (8 pt)
Solve the following using iteration method. Note: T(1) = 1. 2. recurrences GE) T(п) 2T 2.1 3 Т(п) 2T (п — 2) + 5 2.2 Solve the following using Master Theorem. 3. recurrenсes T(п) log n n 4T .3 3.1 n 5T 2 n2 log n T(п) 3.2
Solve the following using iteration method. Note: T(1) = 1. 2. recurrences GE) T(п) 2T 2.1 3
Т(п) 2T (п — 2) + 5 2.2
Solve the following using Master Theorem. 3....
Solve the following recurrences using iteration method. step by step please 1. T(n)=T(n-1)+1/n 2. T(n)=T(n-1)+logn
4. (20 points) For each of the following recurrences, give an expression for the runtime T(n) if the recurrence can be solved with the Master Theorem. Otherwise, explain why the Master Theorem does not apply. Justify your answer (1) T(n) = 3n T(n) + n3 (2) T(n)-STC)VIOn* (3 Tn)T)+ n logn (4) T(n) T(n-1) + 2rn (5) T(n) 16TG)+n2
Solve the following recurrences. You only need to derive the asymptotic solution (in 0) 2. T(n) = 3T(1) + TRT, T(1) = 1.
Solve the following recurrences. You only need to derive the asymptotic solution (in 0) 2. T(n) = 3T(1) + TRT, T(1) = 1.
Data Structure and Algorithm in Java
Question 1. (21 points) Solve the following recurrences using master theorem: a. T(n) T(n/3)+1 b. T(n) 2T(n/4) +n log n c. T(n) 2T(n/2) +n log n
Observe the following recurrences, use master theorem to solve those that can be solved. For those that cannot be solved directly, try to devise some guess of the solution, and then use substitution method to prove your guess. a) T(n)=4T(n/3)+nlgn. b) T(n)=4T(n/2)+n^2 √n. c) T(n)=T(n/2)+T(n/4)+T(n/8)+n.
22. (4 pts) Which one of the following recurrences is linear and homogeneous? T(n) = 2(n+1)- T(m - 2)+T(– 3) An = an-1 + an-1 T(n) = 2T(n/2) + 4n () T(n) =T(m - 2020)+1 the four other possible answers are incorrect