Ononot — Define f(n) as the number of binary strings of length n with

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

Recursionhard

0:00.0

Define $f(n)$ as the number of binary strings of length $n$ with no two consecutive 0's. For example, $f(2) = 3$ because the valid strings are {01, 10, 11}. Which recurrence and initial conditions describe $f(n)$ ?