If you had two sorted arrays of real numbers, a and b, each that had no duplicates in the individual arrays but might both contain some of the same real numbers. What is the fastest way to create a sorted array c, which contains all numbers from both a and b with no duplicates. And what would be the run time.

now suppose a and b are not sorted, what is the fastest way to create a sorted array c, which contains all numbers from both a and b with no duplicates. And what would be the run time.