What is the Time Complexity of T(n) = 7T(n/3) + n^2 and T(n) = 7T(n/2) + n^2 >>>>I applied both akra-bazzi and master theorem but I get different answer….

for T(n) = 7T(n/3) + n^2 using akra-bazzi theorem i get O(n^2) and using the same theorem on
T(n) = 7T(n/2) + n^2 I get O(n^2) again, but in other network resources they say it would give O(n^log7) using master’s theorem. So I am confused between the actual answer.