Given the Following Boolean Function:
F = xy’z + x’y’z + w’xy + wx’y + wxy
- Obtain the truth table of the function.
- Draw the logic diagram using the original Boolean Expression.
- Simplify the function to the minimum number of literals using boolean algebra.
- Obtain the truth table from the simplified function and show that it is the same as in Part 1 of this question.
- Draw the logic diagram of the simplified function and Compare the total number of gates with the logic diagram in part 2.