Hint: Do not use the master theorem! Rather, draw a tree, use it to guess at a solution, and then prove that solution

T(n) =) P(1) 7T(n/2) + (na) if n =1 if n > 1; note a = 7,b=2, f(n) = n2 1. Using substitution (also know as 'guess and verify') method to solve the Recurrence (1)