Find the solution to each of these recurrence relations with the given initial conditions. Use an

iterative approach such as that used in Example $10.$

a$)a_n=-a_{n-1},a_0=5$

b$)a_n=a_{n-1}+3,a_0=1$

c$)a_n=a_{n-1}-n,a_0=4$

d$)a_n=2a_{n-1}-3,a_0=-1$

e$)$

f$)a_n=2n{a}_{n-1},a_0=3$

g$)a_n=-a_{n-1}+n-1,a_0=7$