Given the following Boolean function:
(a) Obtain the truth table of the (unction.
(b) Draw the logic diagram using the original Boolean expression.
(c) Simplify the function to a minimum number of literals using Boolean algebra.
(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).