6. You are analysing a divide & conquer algorithm, and have determined that it has the following characteristics: The algorithm does not recurse if n = 1 . The algorithm finds 5 parts of the data, each of size , in constant time The algorithm recurses 5 times (each time on a part of size ) . the algorithm merges the results from the recursion in time e (n2) (a) Set up thetime recurrence T(n) that describes the running time of this algorithm. (b) Complete the asymptotic analysis of this algorithm's running time, using either recursion tree analysis or the Master Theorem (with explanation of which MT case you are using and why) e) Is this algorithm asymptotically faster, slower, or equal to a (P) time algorithm? Explain why