= (e) Another recursive algorithm is applied to some data A = (aq, ... , am) where m = 2* (i.e. 2, 4, 8,16 ...) where x is an integer 2 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 (1) + m otherwise = + 2. Determine the running time complexity of this algorithm. You will find it helpful to recall that: x=00 1 2k x=1 1 And 21092(x) = x 2log2 =