(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, and c is a constant T(m) = 27 (62) + m otherwise Determine the running time complexity of this algorithm. You will find it helpful to recall that: x=00 1 1 2k x=1 And 2log2(x) = x 15 markal