Show that a substitution proof with the assumption T(n) cn^2 fails for the recurrence, T(n) = 4T(n/2) + n, is T(n) = (n^2). Then show how to subtract off a lower-order term to make a substitution proof work.