The universal gate that can be used to implement any Boolean expression is __________
(a) NAND
(b) EXOR
(c) OR
(d) AND
I got this question in a job interview.
My query is from Logic Gates in section Boolean Algebra and Logic Circuits of Computer Fundamentals