wby not n^2, why n?

16, Given are two arrays A and B, each of size n and each containing integers sorted in increasing order. For a given target value T, one can determine whether there exist an entry a in array A and an entry b in array B such that a +b T in what time? Mark the tightest bound. A **O(n) B O(logn) C O(n log n) D O(n2) E none of the above holds ka