please I need it urgent thank

6 Mergesort- 10 points In merge sort, we merge 2 sorted array together as a subroutine. You are being asked to solve a related problem: Given k sorted arrays, each of size n, (so that there are kn elements in all), give an algorithm that will merge all k arrays into one large array of size kn. Analyze the worst case time and space complexity of your algorithm. Please provide a pseudocode of your algorithm