If n is divisible by 6, then n is divisible by 2 If n is divisible by 6, then n is divisible by 3 If n is divisible by 2, then n1 is odd n 1 is not odd. (b) Now, let p be "n is divisible by 6", q be "n is divisible by 2, r be "n is divisible by 3" and s be "n 1 is odd". Write a formula using these variables that says that the premises together imply the conclusion (from part a)): if the argument is valid, this has to be a tautology. Take the negation of this formula and convert this negation into CNF form Formula: Its negation: Negation in CNF: If n is divisible by 6, then n is divisible by 2 If n is divisible by 6, then n is divisible by 3 If n is divisible by 2, then n1 is odd n 1 is not odd. (b) Now, let p be "n is divisible by 6", q be "n is divisible by 2, r be "n is divisible by 3" and s be "n 1 is odd". Write a formula using these variables that says that the premises together imply the conclusion (from part a)): if the argument is valid, this has to be a tautology. Take the negation of this formula and convert this negation into CNF form Formula: Its negation: Negation in CNF