Exercise $10\mathrm{.}3\mathrm{.}2$: The problem $4TA-$SAT is defined as follows: Given a bool$-$

ean expression $E,$ does $E$ have at least four satisfying truth assignments. Show

that $4$TA$-$SAT is NP$-$complete.