$F(z_1,...,z_n)$ is a Boolean expression. The assignment of variable ($x_1,...,x_n \in {0, 1}$) is the answer of $F$, if $F$ for that assignment equals to $1$.
If that case is true and the conditions are met, then both of them are considered to be NP-Hard.
A) The number of answers of $F$ in $DNF$ format.
B) The number of answers of $F$ in $CNF$ format.
DNF and CNF are HERE
Can anyone describe to me in clear, simple, and concise words why both of them are true?