O words Question 8 10 pts 1. [4 points] Using the substitution method, verify that the solution to recurrence, T (n) = 2T (n-1) +2, is (n2") 2. [4 points] The table below describes information about five recurrences of the form, T (n) = at (8) + f(n). Fill in the missing values in the table. # a b f(n) Tn) 1. 9 3 O(n) 2. 8 2 3. 2 (n logn) O(n) 8(n*) 0(n) 4. 16 2 5. 9 5 (n) Edit View Insert Format Tools Table To V Da 12pt er 7 | Paragraph