8. The number of ways to buy n dollars of tickets is represented by an, 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: a0 =1；a1 = 1；) (A) (B) (C)(D) (E) none of the above.