Recall that the Fibonacci sequence is defined by starting with F = 1, F = 1, and then via the recurrence relation Fn = Fn-1 + Fn-2 for all n 2. Prove by induction that the nth Fibonacci number Fn is even if and only if n = 0 (mod 3).