DO NOT USE C++ COMPILER

Write a recursive function (PSEUDOCODE) using the following sequence of numbers defined by the equation in part a. And the same goes for part b. BUT the recursive function is supposed to take a positive integer ans returns the sum of the digits of the integer.

5. (20 points) Answer the following: a. (10 pts) Let f(1) = 2 and f(2)=-1. Write a recursive function (pseudocode) which generates a sequence of numbers defined by the equation f(n) = f(n-1) + f(n - 2), for n > 2. b. (10 pts) Write a recursive function (pseudocode) that takes a positive integer as an input and returns the sum of the digits of the integer. (Example: If the input is 34781, then output will be 23.)