1. Engineering
  2. Computer Science
  3. solve the following recurrence relations using any of the following...

Question: solve the following recurrence relations using any of the following...

Question details

Solve the following recurrence relations using any of the following methods: unrolling, tail recursion, recurrence tree (include tree diagram), or expansion. Each case, show your work.

(a) T(n) = T(n−4) + Cn if n > 1, and T(n) = C otherwise
(b) T(n) = 3T(n−2) + 1 if n > 1, and T(n) = 3 otherwise

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution