Given two sorted arrays A and B and an integer number k, return the first k pairs from the set A x B ordered by the sum of the elements A x B-cartesian product, ie. if A = fal, , an} and B = {b1, b2, .., (a1, bn), .., (an, bn) the set of A.length *B.length pairs. , bn), A x B = {(a1, b1), (a1, b2), Testcase: input: A = {1, 2, 5), B = {2,4}, k = 4 output: (1, 2), (2, 2), (1, 4), (2, 4)) Provide the solution (pseudocode or just a description of the method). Please, note that if A.length is large (say 1000) and B.length is large (say 1000), an implementation of your algorithm should still be able to handle the