iv) (2 pts.) Express the function F in terms of minterm expansions (short hand form).

v) (3 pts.) Draw the truth table for function F.

vi) (4 pts.) Show using K-map that the function obtained in stage (ii) is indeed the minimal function.

5. (18 pts.) Given the following circuit diagram: i) ii) (3 pts.) Determine the Boolean function F(x,y,z) implemented by this circuit. (3 pts.) Reduce F using Boolean algebra to an expression with minimum literals and draw the ) (a pts) Using algebraic manipulation esess the functin F as a sum of minterms