suppose we are given two n-element sorted sequences a and b that should not be viewed as sets (that is, a and b may contain duplicate entries). describe an o(n)-time method for computing a sequence representing the set a ∪ b (with no duplicates). present pseudocude and analyze the running time. you do not have to argue correctness (but, obviously, your method must be correct)
