Q1: Simplify the following Boolean functions, using three-variable maps: (2 Marks) (a) F(x,y,z)=(2,3,4,5) (b) F(x,y,z)=(1,2,3,5,6,7) Q2: Simplify the following Boolean expressions, using three-variable maps: (2 Marks) (a) F(x,y,z)=xy+yz+yz (b) F(x,y,z)=xyz+xyz+xyz Q3: Simplify the following Boolean functions, using four-variable maps: (2 Marks) (a) F(w,x,y,z)=(1,4,5,6,12,14,15) (b) F(A,B,C,D)=(2,3,6,7,12,13,14) Q4: Simplify the following Boolean function F, together with the don't-care conditions d, and then express the simplified function in sum-of-minterms form: (a) F(x,y,z)=(0,1,4,5,6),d(x,y,z)=(2,3,7) (3 Marks) (b) F(A,B,C,D)=(0,6,8,13,14),d(A,B,C,D)=(2,4,10) Q5: Draw a NAND logic diagram that implements the complement of the following function (2 Marks) F(A,B,C,D)=(0,1,2,3,6,10,11,14) Q6: Design and Implement 8-to-1 Multiplexer also write the truth table and boolean function. (2 Marks) Q7: Construct BCD adder with circuit diagram and explain the truth table