Let Fn denote the nth term of the Fibonacci sequence. Fo = 0, F1 = 1, Fn = Fn-1+Fn-2 for n > 1. Prove using induction that Fn+1Fn+2 = FnFn+3 + (-1)" for n > 1