Solve the problem using a Divide and Conquer Strategy:

Input: a set of S of n real numbers and a single real number x

Output: returns true if S contains two numbers that sum to x, and false otherwise

Design an O(n*log(n)) algorithm for the problem.

Give the pseudo-code for the algorithm and justify why the algorithm has the specified complexity.