Assuming (127-no) = (abcdefg),, a Boolean function F(A,B,C,D) is given by the following truth table: (127-no) = (abcdefg) ABCD F 0000 0001 0010 0011 0100 0101 0110 0111 1000 1001 1010 1011 1100 1101 1110 PRODUTXACHAX g d x: don't care a) Draw the corresponding Karnaugh map for the Sum of Products (SOP) minimization, obtain the minimal SoP expression and give the corresponding standard SOP form circuit for F(A,B,C,D). b) Perform the Logisim simulation of the obtained SoP circuit and verify that the circuit produces the correct F output. c) Draw the corresponding Karnaugh map for the Product of Sums (PoS) minimization, obtain the minimal PoS expression and give the corresponding standard PoS form circuit for F(A,B,C,D). d) Perform the Logisim simulation of the obtained PoS circuit and verify that the circuit produces the correct F output. e) Implement F(A, B, C, D) using only NAND gates. f) Implement F(A,B,C,D) using only NOR gates. Activate W Go to Settings