To verify De-Morgan's theorems.
One of the statements of De-Morgan’s theorem states that
'AND' and 'OR' operations are interchangeable through negations
The circuit diagram shown below represents

If individual negations are applied on two AND statements then its same statement is
Identify the logic gate that can be drawn from below diagram

If individual negations are applied on two OR statements then its same statement is
Identify the logic function described by given diagram

As per De-Morgan’s Law, (A U B)' is equal to
Identify the type of gate represented by phrase 'Any low input guarantees high output'.
As per De-Morgan’s Law, (A ∩ B)' is equal to