




To address this, we first derive the Boolean expression for output Y from the given truth table. Subsequently, we determine the Boolean expression for each of the provided logic circuits. The correct circuit is the one whose derived Boolean expression matches that obtained from the truth table.
The truth table is:
| A | B | Y |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 0 |
| 1 | 0 | 1 |
| 1 | 1 | 1 |
Observation of the truth table indicates that Y is 0 when A is 0, and Y is 1 when A is 1. The value of Y is unaffected by the input B. Consequently, the Boolean expression for the output is:
\( Y = A \)
The output expression for this circuit is \( Y = (A + B) \cdot B \). Simplifying:
\( Y = A \cdot B + B \), which simplifies to \( Y = B \) by absorption law. This does not match \( Y = A \).
The output expression for this circuit is \( Y = (A + B) \cdot A \). Simplifying:
\( Y = A \cdot A + A \cdot B = A + A \cdot B = A(1 + B) = A \). This matches the Boolean expression derived from the truth table.
The output expression for this circuit is \( Y = (A + B) \cdot \bar{B} = A \cdot \bar{B} + 0 = A \cdot \bar{B} \), which only holds when A=1 and B=0, which is inconsistent with the truth table.
The output expression for this circuit is \( Y = (A + B) \cdot \bar{A} = \bar{A} \cdot B \), which only holds when A=0 and B=1, which is inconsistent with the truth table.
Upon analyzing all circuits, only circuit (2) yields the Boolean expression \( Y = A \), which matches the truth table. Therefore, logic circuit (2) is the correct solution.
The correct option is (2).
Which logic gate is represented by the following combinations of logic gates?


