NOTE: This is a multi$-$part question. Once an answer is submitted, you will be unable to return to this part.

Let an be the number of ways to climb n stairs if a person climbing the stairs can take one stair or two stairs at a time.

Identify the initial condition for the recurrence relation in the previous question.

$($You must provide an answer before moving to the next part.$)$

Multiple Choice

a$0=1$ and a$1=1$

a$0=0$ and a$1=1$

a$0=1$ and a$1=2$

a$0=2$ and a$1=2$