




To determine the truth table of the given logic circuit, we need to analyze the circuit step-by-step.
The circuit consists of:
Let's break down the steps:
The final expression \(\overline{\overline{A} + \overline{B}}\) represents the logical NAND operation, which states \(A \cdot B\) when expanded using De Morgan's laws.
| A | B | \(\overline{A}\) | \(\overline{B}\) | \(\overline{A} + \overline{B}\) | Y |
|---|---|---|---|---|---|
| 0 | 0 | 1 | 1 | 1 | 0 |
| 0 | 1 | 1 | 0 | 1 | 0 |
| 1 | 0 | 0 | 1 | 1 | 0 |
| 1 | 1 | 0 | 0 | 0 | 1 |
Based on the truth table, the correct answer matches the option with the following outcomes:
Hence, the truth table of the circuit corresponds to the NAND logic, and the correct answer is the option provided above.