Back
1 . A bitstring is called 01-free if it does not contain 01. Let $n \geq 2$ be an integer. How many 01-free bitstrings of length $n$ are there?
(a)
$n-1$
(b)
$n+1$
(c)
$n+2$
(d)
$n$