For a 3CNF $\phi$, denote by $c(\phi)$ the largest number of clauses satisfied under an assignment. Define:$\mathrm{MAX3SAT} = \{\langle\phi, k\rangle\mid c(\phi) = k \text{ and }\phi\text{ is a 3CNF}\}$.Prove that NP = coNP if and only if MAX3SAT is in NP.I've been working on this forever and can't seem to figure out anything. Any help?
MAX3SAT proof help? Showing that NP = coNP iff MAX3SAT is in NP
complexity theory;np complete