Any set of logic-gate types that can realize any logic function is called a complete set of logic gates. For example, 2-input AND gates, 2- input OR gates, and inverters are a complete set, because any logic function can be expressed as a sum of products of variables and their complements, and AND and OR gates with any number of inputs can be made from 2-input gates. Do 2-input NAND gates form a complete set of logic gates? Prove your answer.

Explanation:

We can use the following method to solve the given problem.

The two input NAND gate logic expression is Y=(A*B)'

we can be able to make us of this function by using complete set AND, OR and NOT

we take one AND gate and one NOT gate

we are going to put the inputs to the AND gate it will give us the output = A*B

we collect the output from the AND and we put this as the input to the NOT gate

then we will get the output as = (A*B)' which is needed