I need help with Question 3.

2. Give truth tables for the following Boolean functions. Use Os and is for F and T. (a) Z= A.B (b) Z= A.B + A (c) Z= A + B. A (d) Z = (4.B)+(AB) (e) Z = (A + B). (A + B) (f) Z = (A. B) + (A+C) (g) 2 = (A. B) + (AC) +( BC) (h) 2 = (A + B).(C+D) 3. For each of the formulas in question 2, use and, or, and not gates to draw a circuit whose output is the value of Z. Don't draw the not gates; use the "bubble notation to indicate the negation of the input or output of an and or or gate. 4. The exclusive or Boolean operator combines two Boolean inputs and is true iff exactly one of the inputs is true, and false otherwise. In Boolean algebra, the symbol e represents exclusive or. (a) Draw the truth table for the two input Boolean function C = AEB. (b) Give a Boolean formula for AB that uses only the operations, +, and/or logical negation