Answer the following question about Conjunctive Normal Form (CNF), in each case justifying your answer.

(i). Show that any formula may be rewritten to an equivalent formula in CNF.

(ii). Is there a polynomial p so that a general formula of size n can be rewritten to an equivalent formula in CNF of size at most p(n)?

(iii). What if we change equivalent to equisatisfiable in the previous question?

(iv). Use Tseitins algorithm to convert ((p (q r)) ((x y) (u v))) to CNF.