Suppose the following recurrence relation is given: tn - -6-tn-1 +8tr-2 = 0 Restate this recurrence as a characteristic equation. Then, find the roots of this equation. Now, assume (for some initial conditions) that c1 = 1, and that c2 = 1. Then, what is the runtime (or number of steps needed) for this function when the input is of size n = 3?