9. (10 pts) Give the pseudocode for a O(n log n) algotithm that, given an array S of n integers and another integer x, determines whether or not there exist two elements of S that sum to x. You may use any algorithms we studied (just by making calls and passing approporiate parameters, no need to explain). Justify the complexity of your algorithm