Solve each of the following recurrence relations by giving a

Solve each of the following recurrence relations by giving an explicit formula for an, For each, calculate a9. Prove that your formula for 1 is correct using induction. 1). a_n = 10a_(n1),a_0 = 3.

2). a_n = a_(n1),a_0 = 5.

3). a_n = 8a_(n1) 15a_(n2),a_0 = 1,a_1 = 4.

4). a_n = 4a_(n1) 3a_(n2),a_0 = 1,a_1 = 2.

Solution