Problem 1. Let S1 and S2 be two sets of integers (they are not necessarily disjoint). We know that S1=S2=n (i.e., each set has n integers). Design an algorithm to report the distinct integers in S1S2 using O(nlogn) time. For example, if S1={1,5,6,9,10} and S2={5,7,10,13,15}, you should output: 1,5,6,7,9,10,13,15. Problem 2. Same problem as above. However, this time we assume that S1 and S2 have been sorted, i.e., each set is given in an array where its elements are in ascending order. Give an algorithm that runs in O(n) time