Consider an instance of the Satisfiability Problem, specified by clauses C1, Ck over a set of Boolean variables x!, ......, xn. We say that the instance is monotone if each term in each clause consists of a nonnegated variable: that is, each term is equal to xi, for some i, rather than x_i^bar. Monotone instances of Satisfiability are very easy to solve: They are always satisfiable, by setting each variable equal to 1. For example, suppose we have the three clauses (x_1or x_2), (x_1 or x_3), (x_2 or x_3). This is monotone, and indeed the assignment that sets all three variables to 1 satisfies all the clauses. But we can observe that this is not the only satisfying assignment, we could also have set X1 and X2 to 1, and X3 to 0. Indeed, for anymonotone instance, it is natural to ask howfew variables we need to set to 1 in order to satisfy it. Given a monotone instance of Satisfiability, together with a number k, the problem of Monotone Satisfiability with Few True Variables asks: Is there a satisfying assignment for the instance in which at most k variables are set to 1? Prove this problem is NP-complete