$$ \begin{array}{1} \text { 2. Let MSAT }=\{\langle\phi, k angle \mid \phi \text { is a boolean formula with no negated literals and is } \ \text { satisfiable with at most } k \text { variables set to true } } \text {. } \text { show that VERTEX-COVER } \leq p \text { MSAT. (That is, provide a polynomial time} \ \text { computable function } f \text { such that } w\in \text { VERTEX-COVER if and only if } f(w) \in \text { MSAT. } \text { You need define } f, \text { and also show that it has the desired property.) } \end{array} $$ CS.VS.10111