Given two sets S1 and S2 (each of size n), and a number x, depict an O (nlogn) calculation for discovering whether there exists a couple of components, one from S1 and one from S2, that signify x. (For incomplete credit, give a Θ (n2) calculation for this issue.)