. A truth assignment for a Boolean formula with n variables can be viewed as a sequence of n bits. The weight of such an assignment is the number of 1s in this sequence. Consider the following decision problem: Given a Boolean formula, determine whether it has a satisfying assignment of weight at most 2. Is this problem in P? Yes, no, unknown? Justify your answer (if your answer is yes, briefly describe a polynomial-time algorithm).