i need answers to the four questions

Problem 1: Given the following Bookan function: g(w, x, y, z) x x + xyz + x 2 +wy a) Provide the truth table for g. b) Draw the logic diagram for g. Problem 2: Evaluate the following switching expressions for the bit vector (1,1,0,1,0): a) F(a, b, c, d, e) = a (b + c) + de b) E(X4, X3, X2, X1, x) = x (x3 + x2 x1) + x4 Problem 3: Given the following Boolean function: a) How many variables are present in the function h? b) How many literals are in the function h? c) How many terms are in the function h? d) Provide the truth table for the function h. c) Draw the logic diagram that implements h using NOT, AND, and OR gates only. Problem 4: Simplify the switching expressions below to a minimum number of literals: 1. a b+ac+bc 2. (X y + xy + y + y2 3. C+AD) (AB+CD) 4. xy + x (wz+wz)