discrete math

A sequence do, a1, a2, . . . is defined recursively as follows: ao a1 9 ak = 5ak-1 - 60k-2 for all integers k > 2 Use strong mathematical induction to prove that for all integers n > 0, an = 5 . 32 - 3. 2n