Note that this is a different question, do not copy the answer to a similar question if you do not know the answer.

(d) A recursive algorithm is applied to some data A = (az,..., am) where m2 2 and m is even. The running time T is characterised using the following recurrence equations: T(2) = c when the size of A is 2 T(m) = T(m - 2) + c otherwise Determine the running time complexity of this algorithm. Note that m is even and the problem size reduces by 2 for each recursion