How do I prove tight bound

694 Views Asked by At

I have a recurrence relation:

T(n)= 3T(n-1)-2T(n-2) Where n>1 .

note when 1, n=1. and when 0, n=0 .

Find a tight bound for T(n). How do I now prove that it's big O and Ω in order to prove it's tight bound

Not really sure how to solve this. Any help would be greatly appreciated, thanks!