The number of ways to buy $n$ dollars of tickets is represented by $a_n$, if only 1-dollar and 2-dollar bills can be used. What of the following can be the recurrence relation for our question? (initial condition: $a_0 = 1$; $a_1 = 1$;)