1. (i) Draw and explain functionality of 3 basic gates, 2 universal gates, XOR and XNOR gates. Show that an OR gate can be implemented using only NAND gates. (ii) Given the basic identities of Boolean algebra, prove that A'B + B'C + AC' = AB' + BC' + A'C 2. Given the basic identities of Boolean algebra, prove that (i) (ii) (A+C)(A' + B)(B+C) = BC, if AB = 0 and A + B = 1. ABC' + BC'D' + BC + C'D = B + C'D. 3. (1) Use only NAND gates to implement the Boolean function F = AC' + BC. (ii) Use only NOR gates to implement the Boolean function F = AB + BC. 4. Write the truth tables and draw the logic circuits for the following Boolean functions: (i) F = A +BC'. (ii) F = AB + C' + D.