Describe the following sequence recursively. Include initial condition of $a_1.$

$a_n=$ the number of bit strings of length $n$ with at least two consecutive ones.

a$)a_1=$

$(2pts)$

b$)a_2=$

$(2$ nts$)$

c$)a_n=$

$(4$ nts$)$