I need its Solution.

The sequence of numbers 1, 1, 3, 5, 11, 21, 43, 85, 171, 341, ... is like the original Fibonacci sequence except that it is defined recursively by f, = 1, f, = 1, and f= f + 2f for n > 2. Use strong induction to prove that With that formula, use your calculator to find f