The minimum number of 2-input NAND gates required to implement the Boolean function Z=A$$\overline {B\,} $$C, assuming that A, B and C are available, is

Minimum number of 2-input NAND gates required to implement the function, f=($$\overline X $$+$$\overline Y $$)(Z+W) is

For the circuit shown below the output Fis given by

The Boolean function A+BC is a reduced form of