To solve non-homogeneous linear recurrence relations with constant coefficients and with initial conditions.
Show all work. i.e., justify your answers.
Find the general and specific closed-form solutions for the analysis of the Towers of Hanoi algorithm using the method of recurrence relations: $t_n - 2 t_{n-1} = 1$ and $t_1 = 1$