Problem $3.$ Merge K$-$Arrays

You are given $k$ sorted arrays, each containing $\frac{n}{k}$ elements. Design an algorithm to merge these arrays into a single sorted array using divide$-$and$-$conquer.$($a$)$ Write the pseudocode of your algorithm by filling in the MERGEKARRAYs algorithm. $($Note: You can assume you have a helper function merge$()$ that can merge two sorted arrays$).($b$)$ Analyze the time complexity of your algorithm using the Master Theorem.