In class, we saw an algorithm that takes two sorted arrays and merges them together

into one sorted array. Write an algorithm that takes three sorted array A$,$ B$,$ and C$,$ and

returns one sorted array, D$,$ with all three collections of entries. Assume that there is a

total of $n$ elements in all. How many comparisons are done? How much work is done in

the worst case?