1. [4 points] Using the substitution method, verify that the solution to recurrence, T(n)=2T(n1)+2n, is (n2n) 2. [4 points] The table below describes information about five recurrences of the form, T(n)=aT(bn)+f(n). Fill in the missing values in the table