Given that f0 0 fn 2fn 2 for n 1 a recursive definition

Given that f(0) = 0, f(n) = 2f(n ? 2) for n ? 1 a recursive definition of a function f from the set of nonnegative integers to the set of integers. If f is well defined, find a formula for f(n) when n is a nonnegative integer and prove that the formula is valid.

Identify the proof for the formula f(n), obtained in part (a), using mathematical induction

Which one is correct