Assume that you are given an algorithm named Merge that can merge two sorted integer arrays of size n and m to generate a new sorted array of size n + M in O(m + n) time. Your task is to use Merge merge k sorted integer arrays each containing n elements, and output a single sorted array. Consider the following algorithm for this task. Let A_1,A_2,..,A_k be the input arrays. A = empty array. For i in range [1...k] A = Merge (A_i, A): Return A: Derive the worst-case asymptotic time complexity of the above algorithm