let a and b be two sequences of n integers each. given an integer x, describe an o(n log n)-time algorithm for determining if there is an integer a in a and an integer b in b such that x