Assuming that P=NP - Finding an optimal algorithm for 3SAT
The following language is in NP (why?):
$$
\{ (\phi,k) : \text{$\phi$ is a CNF and there is an assignment satisfying at least $k$ clauses of $\phi$} \}.
$$
I’ll let you finish the proof.