I have been given a time complexity recursive function T(n) = 9 T(n/3) + (n)2 [read as n square]. Now I am supposed to find out the precise values of T(3) etc etc ..
Please help me understand as to what needs to be done. Is this just plugging in the values? And should I consider (n)2 in calculating T(3).?
Please help me understand.