算法概论习题-8.3证明吝啬SAT问题是NP-Complete

题目：STINGY SAT is the following problem:given a set of clauses(each a disjunction of literals) and an integer k, find a satisfying assignment in which at most k variables are true, if such an assignment exists. Prove that STINGY SAT is NP-complete.题目：STINGY SAT is the following problem:given a