Logic design

Q. No. 1: Simplify the following Boolean functions to a minimum number of literals: (1) F-xz+xx+xyz (11) 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: () F=(BC' + AD 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 Ti and T2 to minimum number of literals A B TI 0 0 0 0 1 0 0 1 1 1 0 0 1 1 0 1 0 1 1 1 0 0 1 1 1 1 0 1 Note: Use logic gate simulator to draw the circuit