(Solved): Q: 4. T(n) = 2T(n/4&…..

4. T(n) = 2T(n/4) +1

5. T(n) = 2T(n/4) +n

6. T(n) = 2T(n/4) + n

7. T(n) = 2T(n/4) +n2

solve these recurrences by master theorem Show that f(n)= n2 +2n+1 is O (n2 ). Show that f(n)= n2 +2n+1 is not O(n). Compute c and no.

T(n) = 3T(
n/2 ) +n

solve this recurrence by recursion tree answer these questions stepwise in detail