You could try some simple cases and count the number of operations. I'm not sure if there's supposed to be a complexity factor for "comparing" versus "copying" data. As an example of a simple case, here are two sets of integers to be merged:
{1, 2, 5, 8, 9} and {3, 4, 6, 7, 10}
What would the complexity be if each set only had 4 integers instead 5? What if each set only had 3 integers instead of 5?
