QUESTION :You are provided an integers N. You need to count all possible distinct binary strings of length N such that there are no consecutive 1’s.
In classroom(recursion 3,quick thinking ,optimal binary strings) sir said to use
fibb(n-1)+fibb(n-2);
but here it is giving wrong output,what’s wrong my code
