Nonrecursive mergesort. Given (n) strings, create (n) queues, each containing one of the strings. Create a queue

Question:

Nonrecursive mergesort. Given $n$ strings, create $n$ queues, each containing one of the strings. Create a queue of the $n$ queues. Then, repeatedly apply the sorted merging operation from the previous exercise to the first two queues and enqueue the merged queue. Repeat until the queue of queues contains only one queue.

Fantastic news! We've Found the answer you've been seeking!