Let $a_{n}$ be the number of $n$-bit strings that do NOT contain two consecutive $1's.$ Which one of the following is the recurrence relation for $a_{n}?$
- $a_{n}=a_{n-1}+2a_{n-2}$
- $a_{n}=a_{n-1}+a_{n-2}$
- $a_{n}=2a_{n-1}+a_{n-2}$
- $a_{n}=2a_{n-1}+2a_{n-2}$