Problem $12$: Divide$-$and$-$Conquer Recurrences

Consider the recurrence that could potentially arise in the analysis of a divide$-$and$-$conquer algorithm:

T$(1)=1,$ T$($n$)=27$T$($n$/3)+$ n for n $>1$

$[$a$]$ Use the Master Theorem to determine the order of magnitude of T$($n$).$