Can the following recursion:

T(n) = 2T(n/4)+ n^3 + n^2

be solved using Master Theorem?

It meets the preconditions that f(n) is positive, a>=1, b>1, and the difference between (n^3 + n^2) and n/2 (logarithm base 4 of 2) is polynomial. Would f(n)=O(n^3)?