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. \begin{tabular}{|c|c|c|c|c|} \hline# & a & b & f(n) & T(n) \\ \hline 1. & 9 & 3 & (n) & \\ \hline 2 & 8 & 2 & (n3logn) & \\ \hline 3. & & 2 & (n2) & (n2) \\ \hline 4 & 16 & 2 & (n4) & \\ \hline 5. & 9 & 5 & & (n2) \\ \hline \end{tabular}