Ononot — The number of binary strings of length n without '11' follow

Guest Session: 1 Question Remaining. Create Account to save progress.

Recursionhard

0:00.0

The number of binary strings of length $n$ without '11' follows $f(n) = f(n-1) + f(n-2)$ . If $f(1)=2, f(2)=3$ , what is $f(4)$ ?