6. You are playing a board game in which on each turn you may advance by crawling one space, walking one space, bouncing two spaces, leaping two spaces, or ying two spaces. Let a,, be the number of different sequences of moves you can use to travel exactly 71 spaces. (a) (10 points) Derive a recurrence relation and initial conditions for an. (b) (10 points) Solve your recurrence relation to nd a closed form for an. You may use any method to do so