5. The Fibonacci numbers are defined as: f1 = 1 , f2 = 1 , and fn = fn1 + fn2 , for n 3 . Give a proof by induction to show that 3 | f4n, for all n 1 .