Plss explain how to do this one

#1

What is the complexity of the following recurrence :
7T(n/2) + an^2

#2

comparing with the equation (MASTER THEOREM)
T(n) = aT(n/b) + ⊖(n^k logn p)

we get ,a=7,b=2,k=2,lognp=a
assuming a = 1
p = 0

now it satisfies a>b^k,

so this is first case of master theorem
image

now after substituting the values
we get
T(N) = O(n^3)