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'x + xyz (1) F=zx + zx x 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: (1) F =(BC' + A'D(AB' + CD') (ii) F=[(AB)'A][(AB)'B] Q. No. 3: Implement the Boolean function F = xx + x'x + x'z using only AND and NOT gates. Q. No. 4: Simplify the following functions T1 and Tz to minimum number of literals A B T: T2 0 0 0 0 0 1 0 0 0 1 0 1 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 1 0 1 Note: Use logic gate simulator to draw the circuit