A recursive algorithm satisfies $T(n) = T(n-1) + T(n-2)$ with $T(1) = 1, T(2) = 1$ (similar to Fibonacci). Without deriving the closed form, which asymptotic bound best describes $T(n)$?