Fibonacci Sequences

let (f_k) be the Fibonacci sequence, show that:

a) For every integer n>= 0, we have f_4(n+1) = 3f_4n+1  +   2f_4n

b) Use a) in order to prove by induction that          ∀n  Є N, 3 | f_4n