Show that the following problem is NP-hard.Input: A boolean function in CNF such that every clause has at most three literals and every variable appears in at most three clauses.Output: An assignment that evaluates the given function TRUE.