1. Let our domain be the natural numbers greater than 1 denoted by N>1. Define: P(x) = "x is prime" Q(r, y) = "x divides y" Consider the following statement: For every x that is not prime, there is some prime y that divides it. " (a) Write the statement in predicate logic. (b) Negate your statement from part (a). (c) Write the English translation of your negated statement. Your statement should sound like English not predicate logic in words. (d) Write the following statement using the given predicates: "There is exactly one prime number that is even."