1- Draw the logic diagram for the following Boolean expressions. The diagram should correspond exactly to the equation. Assume that the complements of the inputs are not available a. ABC+AB+AC b. X(YZ+YZ)+W(Y+XZ) c. AC(B+D)+AC(B+D)+BC(A+D) 2- Obtain the truth table of the following functions, and express each function in sum-oi minterms and product-of-maxterms form: a. F1(A,B,C)(A+B)(B+C) b. F2(W,X,Y,Z)=W.X.Y+W.XZ+W.X.Z+Y.Z 3- For the Boolean functions E and F, as given in the following truth table: a. List the minterms and maxterms of each function. b. List the minterms of E and F c. Express E and F in product-of-maxterms algebraic form. d. Simplify E and F to expressions with a minimum of literals