A **NAND gate** (NOT-AND gate) is a fundamental digital logic gate that produces an output which is the negation of the AND gate. It is one of the most widely used gates in digital circuits, particularly because it is a universal gate, meaning any other logic gate can be constructed using only NAND gates.
The **truth table** for a NAND gate is as follows:
\begin{table}[h!]
\centering
\begin{tabular}{|c|c|c|}
\hline
Input A & Input B & Output Y (NAND)
\hline
0 & 0 & 1
\hline
0 & 1 & 1
\hline
1 & 0 & 1
\hline
1 & 1 & 0
\hline
\end{tabular}
\caption{Truth table for a NAND gate}
\end{table}
Step 1: Analyze the given inputs.
When both inputs \( A \) and \( B \) are HIGH (\( 1 \)):
\[
Y = \text{NOT} (A \cdot B).
\]
In this case, \( A \cdot B = 1 \cdot 1 = 1 \), since the AND operation yields 1 when both inputs are 1.
Step 2: Apply the NOT operation.
Next, we negate the result of the AND operation:
\[
Y = \text{NOT}(1) = 0.
\]
Conclusion:
Thus, the output of the NAND gate is **LOW** (\( 0 \)) when both inputs are HIGH.
Therefore, the correct answer is \( \mathbf{(2)} \).