Q1. Consider the third-order recursion tn+2 = n+1 'l' 41in 4tnl with initial values to = 1, t1 = 5, t2 = 1. :3 [a] [1 mark] Generate additional values of tn to fill in the table at the right. The pattern might be simple enough to allow you to guess a general formula. HO [b] [7 marks] Solve the recursion using the r-method which finds geometric sequences tn = r\" that satisfy the equation but not the initial conditions. Be sure you clearly display your final formula for tn. Check your formula with the value of E5 that you calculated at the right