Let FACTOR be the following search problem: given (x), where x is an integer > 2, output (P1,P2, ..., Pm), where each p; is a prime number and x is the product P1P2 *** Pm- Let DIV = {{x,y) | x,y e N and x has a divisor| d with 1 2, output (P1,P2, ..., Pm), where each p; is a prime number and x is the product P1P2 *** Pm- Let DIV = {{x,y) | x,y e N and x has a divisor| d with 1