Homework Help

If Fn represents the n-th Fibonacci number, prove by induction that F4n is divisible by 3 for all positive integers n.