Ex$\mathrm{.}4$ Describe an O$($n log n$)-$time algorithm that, given a set S of n integers and another integer, determines whether or not there exist two elements in S whose sum is exactly x$.$