Find the solution to each of these recurrence relations and

initial conditions. Use an iterative approach such as that

used in Example $10.$

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

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

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

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

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

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

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

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