C++ PROGRAMMING (WRITE PSEUDOCODE AND NOT PROGRAM)

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.)