Consider the recurrence T(n)=3T(n - 1) + 1 with the initial condition that T(0) = 2. We know that we could write the solution down from Theorem 4.1. Instead of using the theorem, try to guess the solution from the first four values of T(n) and then try to guess the solution by iterating the recurrence four times.