Recursive function to compute the number of sequences of n binary digits.

How to Write a recursive function to compute the number of sequences of n binary digits that do not contain two 1s in a row. Write a main function to test this function.

Input:Input consists of the number of binary digits in the sequence.

Output:Output consists of the number of sequences of given binary digits that do not contain two 1s in a row

Sample Input:
Enter the number of binary digits in the sequence:
5
Sample Output:
Number of sequences of 5 binary digits that do not contain two 1s in a row is:
13