4. Consider a recursive algorithm that is structured as follows, for size n: does not recurse if n = 1 (found in-place in constant otherwise recurses four times on parts each of size time) . requires n calculation to assemble the recursion results (a) Write the recurrence T(n) for the running time of the algorithm (b) Use recursion tree analysis to solve T(n) and asymptotically analyse the running time of the algorithm. (c) How does this algorithm compare asymptotically (faster, slower, or the same speed) to an (n log n) algorithm