Computer architecture

1. For the Boolean function (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 t he logic diagram from the simplified expression, and compare the total number of gates with the diagram of part (b). (f) Implement the logic circuit of (c) using only NOR gates