this is big THETA which means you'll need big O and big Omega to solve the problem (i think)

Given the recurrence: T(n) = c n = 1,2 T(n) = 3T(n/3) + cn n > 2 Use the substitution method to show T (n) = (nlgn). Show your work in sufficient details. (Hints: 1. Show T (n) = 0 (nlgn) and T (n) = N(nlgn), respectively) 2. You may assume log? (log%). No need to show it here 3. lg n is log)