(d) The given truth table follows a NAND gate whose output is 1 only if at least one of its input is zero. Its Boolean expression is
$Y = \overline{A \bullet B}$
So that $\overline{1 \bullet 1} = \overline{1} = 0$
$\overline{1 \bullet 0} = \overline{0} = 1$
$\overline{0 \bullet 1} = \overline{0} = 1$
$\overline{0 \bullet 0} = \overline{0} = 1$