Solve the following recurrence relation for a

a) an=3an-1-3an-2+an-3 a0=a1=1, a2=2

then

b) find and solve a recurrence relation for the number of ways to make a pile of n chips using red, white and blue chips and such that no two red chips are together.

Thanks for your help, i keep getting stuck