The boolean expression wxyz u v is equivalent to an expression in 3-cnf (a product of clauses, each clause being the sum of exactly three literals). find the simplest such 3-cnf expression and then identify one of its clauses in the list below. note: -e denotes the negation of e. also note: we are looking for an expression that involves only u, v, w, x, y, and z, no other variables. not all boolean expressions can be converted to 3-cnf without introducing new variables, but this one can.