For the Boolean functions in Q1) to Q2) (a) Construct the truth table. (b) Write the function as a sum of minterms. (c) Draw the Karnaugh Map. (d) Write down all prime implicants. (e) Mark essential prime implicants. Indicate the minterm(s) that make them essential. (f) Find a simplified SOP expression for F using prime implicants. (g) Calculate literal cost (L) and gate input cost (G). Q1) F(x,y,z)=(x+y)(x+z) Q2) F(A,B,C,D)=(0,2,4,6,13,15) For the Boolean functions in Q3) to Q4) you are going to find a simplified Product of Sums expression using the following steps: (a) Construct the truth table. (b) Write the function as a product of maxterms. (c) Draw the Karnaugh Map. (d) Write down all prime implicants for F (complement of F ). (e) Mark essential prime implicants. Indicate the minterm(s) that make them essential. (f) Find a simplified POS expression for F using prime implicants (hint: F=(F) ). (g) Calculate literal cost ( L) and gate input cost (G). (h) Implement using AND, OR gates. (i) Implement using two-level NOR gates. Q3) F(w,x,y,z)=wxz+wxy+wxy+xyz Q4) F(x,y,z)=(xy)z+xy Q5) Draw a multiple-level NAND circuit for the function F(v,w,x,y,z)=yz(x+y)w+(xy+zv). Q6) Draw a multiple-level NOR circuit for the function F(A,B,C,D)=A(B+C+D)+(BCD). Q7) Implement the following Boolean function with XOR and AND gates F(w,x,y,z)=wxyz+wxyz+wxyz+wxyz