Assume that we have l sorted files, of sizes n1, n2, ...nl and we want to merge them to one sorted file. Design a divide and conquer algorithm for this purpose, and derive its time complexity. You should describe the algorithm, and derive the time complexity. (Assume that you have a linear time merge algorithm for sorting two (already) sorted files.)

Please show your work! I will rate quality answers! :)