Simplify the following boolean expressions using K-maps:
F(x,y,z) = ∑(0,2,4,5)
F(w,x,y,z) = ∑(0,2,8,9,10,11,14,15)
F(A,B,C,D) = ∑(2,3,4,5,6,7,11,14,15)
Page 157 #22 - Use a Karnaugh map instead of boolean algebra.
Page 158 #25 - Your truth table will have 3 inputs (8 rows), and 3 output columns(a, b, c). Each output column needs to be simplified using a K-map before designing the circuit. Your circuit will have 3 inputs and three outputs.
Page 158 #28 - Find the expression for F from the circuit diagram, then build the truth table.