Prove formally, via a suitable problem reduction, that the Exact 5SAT problem (i.e., determine the satisfiability of a formula in conjunctive normal form where each clause has exactly five literals) is NP-complete. An informal or incomplete argument will not constitute a proof.