Please explain step by step.

Using the master method, you can show that solution to the recurrence T(n)=4T(3n)+n is T(n)=(nlog34). Show that a substitution proof with assumption T(n)cnlog34 fails. Then show how to subtract off a lower-order term to make a substitution proof work