Suppose you are designing a search aggregator, which for a given query fetches search results from two different search engines and presents an intersection of the two search results. here is a simplified version of this problem: given two sorted integer arrays of lengths m and n, return a new array with elements that are present in both input arrays. the input array may contain duplicates, but there should be no duplicates in the output array. for example, if the input arrays are [17, 23, 23, 35, 43, 47, 69, 78, 80, 84, 84, 86] and [23, 35, 50], the output array should be [23, 35]. (i) describe a brute force solution. what is the worst-case tight big-o time complexity of this brute solution?