question archive During a Michigan football game, every Michigan offensive drive can end in one of four ways: a touchdown, field goal, interception, or punt
During a Michigan football game, every Michigan offensive drive can end in one of four ways: a touchdown, field goal, interception, or punt
Subject:MathPrice: Bought3
During a Michigan football game, every Michigan offensive drive can end in one of four ways: a touchdown, field goal, interception, or punt. However, in order to maintain their lead, the team will never end two consecutive drives with a punt. Find a recurrence relation, f(n), to model the number of ways that Michigan can end n offensive drives. For this question, you only need to find the recurrence, not the initial conditions.
a) f(n)=4f(n−1)
b) f(n)=2f(n−1)+3f(n−2)
c) f(n)=3f(n−1)+3f(n−2)
