3.1 Write a function that computes f(n), where f(n) is given by the recurrence f(n) = f(0) + f(1) + .. + f(n - 1). f(0) = a and f(1) = b where a and b are values entered by the user. Your function should be able to compute f(n) correctly atleast for values of n <= 25 and reasonable values of a and b.
3.2 Exercise 3.11 in the textbook.
3.3 Exercise 3.15 in the textbook.
3.4 Write a non-recursive function to compute the binary representation of a decimal number (i.e. it has the same input-output behaviour as the function f in the Surprise Quiz)
3.5 Write a program that takes in a sequence of characters input by the user and returns "yes" or "no" depending on whether the sequence constitutes a palindrome or not. Before entering the characters, the user is required to enter the number of characters in the sequence. Do not use arrays or strings. (Hint: define an appropriate recursive function)