Complexity of the recursion: T(n) = T(n-1) + T(n-2) + C

Question

I want to understand how to arrive at the complexity of the below recurrence relation.

T(n) = T(n-1) + T(n-2) + C Given T(1) = C and

Answer 1

You can use this general approach described here.Please ask if you have more questions.