Recursive formula

(a) Suppose a function f(n) is defined by the following recursive formula. f(n) = f(n-1) + f(n - 2) + 15/2 f (0) = 0, f(1) = 5 Use the guess-and-check method to get a closed-form formula for f(n). That is, guess a formula for f(n) and use induction to prove that your guess is correct. (b) Suppose a function g(n) is defined by the following recursive formula. g(n) = g(n - 1) + 2n +2, g(0) = 0. Use the unraveling method to get a closed-form formula for g(n). Make sure to show your work