The space complexity of transforming a propositional formula to its CNF is as follows: O(Var(p)*Leng(p)) where Var(p) is the number of variables, and Leng(p) is the length of the p. According to Thierry Boy de la Tour: An Optimality Result…