Runtime Complexity of Recursive Sequence

18 Views Asked by At

I am given $T(n)=2T(n-1)+5^n$, and asked to find the runtime complexity. If there were no $5^n$ term, then the $T(n)$ would clearly be linear, $O(n)$. However, does the $5^n$ term make the complexity of this function $O(5^n)$?