Question #4 (10 points) ( Prove an upper-bound for each of the following recurrence relations. • (2.5 points). if n=1 T(

[answerhappygod]

Question 4 10 Points Prove An Upper Bound For Each Of The Following Recurrence Relations 2 5 Points If N 1 T 1 (44.59 KiB) Viewed 42 times

Question #4 (10 points) ( Prove an upper-bound for each of the following recurrence relations. • (2.5 points). if n=1 T(n) = 5T(n/2) +n if n > 1 - {s(w/2) +1 • (2.5 points). if n = 1 n) T(n) = 2T(n/2) +n if n > 1 >= {2r(m/2) = • (2.5 points). if n = 1 T(n) = 5T(n/2) + n2 if n > 1 = {&r (m/2) + ni • (2.5 points). =1 () T(n) = 8T(n/2) + logn if n > 1 ={/) + lifn sri(m24