Assignment:
Consider the following Boolean truth table:
|
W
|
X
|
Y
|
Z
|
F(w,x,y)
|
|
0
|
0
|
0
|
0
|
1
|
|
0
|
0
|
0
|
1
|
1
|
|
0
|
0
|
1
|
0
|
1
|
|
0
|
0
|
1
|
1
|
0
|
|
0
|
1
|
0
|
0
|
0
|
|
0
|
1
|
0
|
1
|
0
|
|
0
|
1
|
1
|
0
|
1
|
|
0
|
1
|
1
|
1
|
0
|
|
1
|
0
|
0
|
0
|
1
|
|
1
|
0
|
0
|
1
|
1
|
|
1
|
0
|
1
|
0
|
0
|
|
1
|
0
|
1
|
1
|
0
|
|
1
|
1
|
0
|
0
|
0
|
|
1
|
1
|
0
|
1
|
0
|
|
1
|
1
|
1
|
0
|
0
|
|
1
|
1
|
1
|
1
|
0
|
Part A: Express the Boolean function F(w,x,y,z) in sum-of-products form
Part B: Use Boolean algebra (and the Boolean equalities) or the Karnaugh map to simplify the Boolean expression.
Part C: Draw the logic diagram for the simplified circuit using AND, OR, and NOT logic gates if each logic gate can have at most two inputs. Assuming a propagation delay of 20 ns per logic gate, what is the total maximum propagation time through the simplified circuit?
Provide complete and step by step solution for the question and show calculations and use formulas.