Solve the following recurrences with master method, base case is assumed to be T(1)=1. Recall that the standard form is T(n)= aT(n/b) + f(n). T(n)= 3T(n/2)+ n³.

Solve the following recurrences with master method, base case is assumed to be T(1)=1. Recall that the standard form is T(n)=aT(n/b) + f(n). T(n)= 3T(n/2)+n3. Case 2 (f(n) =a g(n)) therefore el log n n 10923. 10923 Case 3 (f(n) >p g(n)) therefore e(lognn None of the above. Case 3 (f(n) >p g(n)), en). Case 1 (g(n) >p f(n)) therefore e(n)