(e) Another recursive algorithm is applied to some data A = (a1, ... , am) where m = 2* (i.e. 2, 4, 8,16 ...) where x is an integer > 1. The running time T is characterised using the following recurrence equations: T(1) = c when the size of A is 1 T(m) = 27 (67) + c otherwise Determine the running time complexity of this algorithm. [10 marks]