C)

Write a recursive function that prints a given positive integer value as its binary equivalent. For example, if the value is 11 the output should be 1011.

D)

The recursive function fibSequence() described in the book and in the lectures generates and prints the first n terms in the fibonacci sequence. Re-write this function so that it actually stores the terms in an array of size n, where n is the number of terms required, as it generates them. The signature of this function is:

void fibSequence(int i,int n, int f[]){ }