Suppose you are given two arrays A[1..n] and B[1..n] of real numbers, both of which are sorted in increasing order, and an additional fixed real number v. Describe in plain English an algorithm, linear in n, that checks whether or not there is a pair of values x, y in the arrays A and B such that x + y = v. (Note: x and y may be both in A, or both in B, or one in A and the other in B)