Problem 8: Given the following Boolean function Express it as sum of minterms Problem 9: Show that the dual of the exclusive-OR is equal to its complement. Problem 10: Simplify the Boolean expressions using three-variables and four-variables maps: a F(x,y,z) = (0,2,3,4,6) b. F(A,B,C,D,-AB,C + B,C,D, + BCD + ACD' + A,B,C + A'BC'D c. F(XYZw)=(2,3,9,11,12,13,14,15) Problem 11: Design a combinational circuit with 3 inputs xyz and three outputs ABC. When the binary input value is 0,1,2,3 the binary output value is one greater than the input. When the binary input is 4,5,6,7 the binary output is one less than the input. Problem 12: Implement F(A,B,C) using a multiplexer. F(A,B,C) = (0,1,5,7) Problem 13: Tabulate the truth table for an 8x4 ROM that implements the four Boolean functions A,B,C,D a. b. Tabulate the PLA programming table for the four Boolean functions. Minimize the number of product terms. Simplify the functions A(x,y,z) (1,2,4,6) B(x,y,z) = (0, 1 ,3,6,7) C(x,y,z) = (2,5,7) D(x,y,z) (1,2,3,5,7)