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, + . # a b f(n) T() 1. 93 (11) 2. 8 2 (n logn) (n) 3. 2. 0(n) 4. 16 2 e(n) 5. 9 5 (n?)