Answer Happy

= = M(O) = 500 M(1) = 500 1.10 = = 500(1.10) M(2) = 500 . 1.10. 1.10 = 500(1.10) M(3) = 500. 1.10. 1.10. 1.10 = 500(1.10)3 M(4) = 500- 1.10. 1.10. 1.10. 1.10 = 500(1.10)4. = = — - The evident pattern in these calculations suggests that M(n) = 500(1.10) = (3.2.2) is a closed-form solution to the recurrence relation.
Prove that the closed-form solution in Equation 3.2.2 matches the recurrence relation in Equation 3.2.1. (See Example 3.8.)