Problem 3. 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). Each set is given in array where its elements are in ascending order. Design an algorithm to report S1S2 in O(n) time. For example, if S1={1,5,6,9,10} and S2={5,7,10,13,15}, you should output: 5,10 . Problem 4. Consider the array A=(5,9,3,10,26,37,14,12). Suppose that we sort Q by the quick sort algorithm. What is the probability that the algorithm compares the numbers 3 and 37