9 views

The minimum number of $\text{NAND}$ gates required to implement the Boolean function $\mathrm{A}+\mathrm{A} \overline{\mathrm{B}}+\mathrm{A} \overline{\mathrm{B}} \mathrm{C}$, is equal to

1. zero
2. $1$
3. $4$
4. $7$