The next three questions use the Fibonacci numbers. These are defined recursively by f0 = 0, f1 = 1, and fn+2 = fn+1 =fn for all n ≥ 0.3. show that for all strictly positive integers n, we have f1 + f3 + ..... + f2n-1 = f2n