Question 1. [6 points] Use the guess-and-confirm method to solve the recurrence 1, T(n) = 0, 5T(n 1) 8T(n 2) + 4T(n 3), if n = 0; if n = 1,2; if n > 3. Question 2. [4 points] Use the iteration method to solve the following recurrence. T(n) = 2T(n/2) + n logn where T(1) =c (here c is a constant). Question 3. [5 points] Use the recursion tree method to determine a good upper bound on the following recurrence. T(x) = T(n - 1) + Ta/2) +n. Question 4. 15 points] Use the recursion tree method to determine a good lower bound on the following recurrence. T(n) = T(n/3) + T(2n/3) + cn, where c is a constant