Given the following recurrence equation: tn - 5tn-1 + 6tn-2 = 2" for n > 1 and to = 0,t1 = 1. What is the worst-case runtime for the above recurrence? Given the following recurrence equation: tn - 5tn-1 + 6tn-2 = 2" for n > 1 and to = 0,t1 = 1. What is the worst-case runtime for the above recurrence