Question 3 (20 pts.) For the Boolean function F = xyz + xyz + w xy + wx'y + wxy (a) Obtain the truth table of F. (b) Draw the logic diagram, using the original Boolean expression. (c) Use Boolean algebra to simplify the function to a minimum number of literals. (d) Obtain the truth table of the function from the simplified expression and show that it is the same as the one in part (a). (e) Draw the logic diagram from the simplified expression, and compare the total number of gates with the diagram of part (b) Question 4 (20 pts.) Simplify the following Boolean functions (using Karnaugh maps ), (a) F(x,y,z)= (0, 2, 4, 5) (b) F(x,y,z)= {(1, 2, 3, 7) (c) F(x,y,zj)= (0,2,4,5,6,7,8,10,13,15) using three-variable maps using three-variable maps using four-variable maps Question 5 (20 pts.) Simplify the following functions, and implement them with two-level NAND gate circuits: (a) F(A, B, C, D = AC'D' + A'C + ABC + AB'C + A'C'D' (b) F(A, B, C) = (A' + C'+D') (A' + C') (C'+D')