I can't figure out how to solve this recurrence relation using the iteration method:$$T(n) =\begin{cases}0, & \text{if $n=0$} \\1, & \text{if $n=1$} \\3T(n-1)+ 4T(n-2),  & \text{if $n >1$} \end{cases}$$
Solve a recurrence relation with two recursion calls using the iteration method
asymptotics;recurrence relation