Solve these recurrence relations together with the initial conditions given.

a) an = an−1 + 6an−2 for n ≥ 2, a0 = 3, a1 = 6

b) an = 7an−1 − 10an−2 for n ≥ 2, a0 = 2, a1 = 1

c) an = 6an−1 − 8an−2 for n ≥ 2, a0 = 4, a1 = 10

d) an = 2an−1 − an−2 for n ≥ 2, a0 = 4, a1 = 1

e) an = an−2 for n ≥ 2, a0 = 5, a1 = −1

f ) an = −6an−1 − 9an−2 for n ≥ 2, a0 = 3, a1 = −3

x divided by 8=y

step-by-step explanation:

28

step-by-step explanation:

8+8+6+6

yes

step-by-step explanation:

yes

no association

step-by-step explanation:

if you have eyes and you can use them efficiently you can see that it just looks like random dots like do a line of best fit and like they're so spread out it's such a weak association you might as well consider it nonexistent