Do not copy from other websites (will be directly downvoted) Correct and detailed answer will be Upvoted Question: Give asymptotic upper bound (represented by O( )) of the recursive function T(n) =...

Do not copy from other websites (will be directly downvoted)

Correct and detailed answer will be Upvoted

Question:

Give asymptotic upper bound (represented by O( )) of the recursive function T(n) = T(n-1) + T(n-2) with T(1)=T(2)=1 viasubstitution method.

Will give thumbs up.