Given $k$ sorted arrays $($with different sizes$)$ containing a total of $N$ elements $($in all arrays$),$

describe an efficient algorithm to print the $N$ elements in sorted order. What is the time

complexity of the algorithm you described $($analyze and show your work$).$

Notes:

To get the mark for this question, you must draw a diagram to illustrate the proposed

solution and then write the steps of the solution clearly.

The mark awarded will be directly proportional to the efficiency of your proposed

solution.