I need the answer soon as possible please 1. B(1) 1.An integer x is given. Design an algorithm of lowest Ocomplexity to determine if there are two elements, one inarray A and another in array B...

I need the answer soon as possible please

Extracted text: Consider the following problem. The input to the probiem is two ascending sorted arrays A and B of positive integers, A (1) < a="" (2)="">< •••="">< a(m),="" m=""> 1. B(1)< b(2)="">< ••="" •="">< b(n),="" n=""> 1. An integer x is given. Design an algorithm of lowest O complexity to determine if there are two elements, one in array A and another in array B such that their product is x. State your algorithm in no more than eight simple English sentences such as sort the elements, add the numbers etc. (These two operations may not be the ones you need in your algorithm.) complexity among the following. Do not write a pseudocode. Circle your (a) O (log (m + n)). (c) O (m n). (b) O (m + n) log (m + n)). (d) O(m²+n²) (e) O (m²+n² log (m + n)). (f) none mentioned before. If your answer is "none mentioned above", state your complexity.