Assignment No 1 Due Date: feb 22, 2021 Q. No. 1: Simplify the following Boolean functions to a minimum number of literals: (1) F= xyz + x + xyz (ii) F = 2X+ za Also implement the simplified Boolean functions using AND, OR and NOT gates. Q. No. 2: Find the complement of the following Boolean functions and reduce them to a minimum number of literals: (i) F = (BC' + A'DAB' + CD) (ii) F=[(AB)'A(AB)'B] Q. No. 3: Implement the Boolean function F = xx+xx + x'z using only AND and NOT gates. Q. No. 4: Simplify the following functions T. and T2 to minimum number of literals A B C 2 1 1 1 1 1 1 1 Note: Use logic gate simulator to draw the circuit