In the EXACT 4SAT problem, the input is a set of clauses, each of which is adisjunction of exactly four literals, and such that each variable occurs at mostonce in each clause. The goal is to find a satisfying assignment, if one exists.Prove that EXACT 4SAT is NP-complete.