From the given logic circuit, the output is formed by taking OR of input and the output of gate .
So, we can write the Boolean expression as:
From the given truth table, the output is the same as input for every value of and .
So, the required output is:
Now compare this with the circuit expression:
This means gate should give such an output that, when ORed with , the final result remains .
If is an AND gate, then:
So,
Using the Boolean identity , we get:
This matches the given truth table exactly.
For other gates, the output will not always remain equal to .
If is an OR gate, then , which is not always equal to .
If is a NAND gate, then . For , we get , but it should be .
If is a NOR gate, then . For , we get , but it should be .
So, the gate must be an AND gate.