(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 2 1. The running time Tis 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 Determine the running time complexity of this algorithm. You will find it helpful to recall that: X=0 2k Xa1 And 21092(x) = x [15 marks)