External sorting handles massive amounts of data that don't fit in memory. To simulate this, you are given an array of k fully sorted 'chunks' (arrays). You must merge them into a single sorted array. (This is conceptually equivalent to merging chunks from disk).
Merge the k sorted arrays into one sorted array.