Write the truth table of $NAND$ gate.

(N/A) $NAND$ gate is a universal logic gate that produces a low output $(0)$ only when all its inputs are high $(1)$. Otherwise, it produces a high output $(1)$.
For a two-input $NAND$ gate with inputs $A$ and $B$ and output $Y$, the Boolean expression is $Y = \overline{A \cdot B}$.
The truth table is as follows:
| Input $A$ | Input $B$ | Output $Y$ |
| :--- | :--- | :--- |
| $0$ | $0$ | $1$ |
| $0$ | $1$ | $1$ |
| $1$ | $0$ | $1$ |
| $1$ | $1$ | $0$ |