T(n) has to do with time complexity

Prove that T(n) = (n^log₃4)

Using the master method, you can show that solution to the recurrence T(n) n is T(n) = (nlog34). Show that a substitution proof with assumption T(n)