program analysis

d) A recursive algorithm is applied to some data A=(a1,,am) where m 3 and m is divisible by 3 . The running time T is characterised using the following recurrence equations: T(3)=c when the size of A is 3 T(m)=T(m3)+c otherwise Determine the running time complexity of this algorithm. Note that m is divisible by 3 and the problem size reduces by 3 for each recursion. [10 marks]