Recall that the Satisfiability Problem (SAT)-the first official "NP-Complete Problem involves a set of literals (Boolean variables) combined with the applications of the unary operator "negation and binary operators "and and "or". Show how the "unrestricted" SAT can be reduced to 3-SAT a version of the Satisfiability problem in which there are exactly three literals separated by the disjunction operator (o) in each clause, and clauses are in turn combined using the conjunctive operator (and)