1. Suppose you are given a set P of integers and another integer x. We wish to use a (Ign) algorithm to decide whether there are 2 integers in P and the product (multiplication) of these two integers equals to x. Show your algorithm and indicate why its complexity is (nIgn). [10 points]