Using the master method in Section 4.5, you can show that the solution to the recurrence T(n)-4T(n/2) n2 is T(n)-(n2). Show that a substitution proof with the assumption T(n) Scn2 fails. Then show how to subtract off a lower-order term to make a substitution proof work