Please ONLY do E and F

CONPUTER Architecture

1. For the Boolean function (a) Obtain the truth table of F. (b) Draw the logic diagram, using the original Boolean einum numb (c) Use Boolean algebra to simplify the function to a min (d) Obtain the truth table of the function from the simp same as the one in part (a). e) Draw the logic diagram from the simplified expression, an gates with the diagram of part (b). Implement the logic circuit of (c) using only NOR gates. r of literals. be olean expression. simplified expression and show tha compare the total number of