Problem II.5 We would like to prove the following statement by contraposition, For all integers x and y, if xy is odd, then x is odd or y is odd.

1. Translate the statement into a statement of predicate logic. 2. Provide the assumption required for a proof by contraposition for the given statement. 3. Provide the conclusion for a proof by contraposition for the given statement. 4. Prove the statement is true by contraposition.