CExercise 144. For the following recursive specifications, work out an altern- ative non-recursive representation of the given function and prove by induction that it satisfies the given specification. (a) Base case f. fo= 0. Step case f. f(n + 1) = fn + 2. (b) Base case f. fo=1. Step case f. f(n + 1) = (n + 1)fn