Boolean Functions Consider two Boolean functions in sum-of-minterms form (AB,C,D)=(0,1,4, 5, 8, 9, 10, 12, 13) E(A, B. C, D)-(3, 5, 7, 8, 10, 11, 13, 15) Simplify these functions by means of maps. Obtain a composite logic diagram four inputs, A, B, C, and D, and two outputs, and F. Implement the two fun two functions om plement Plot the following Boolean function in a map Combine the 1's in the map to obtain the simplified function for Fin sum-of-products form. Then combine the O's in the map to obtain the simplified function for F, also in sum-of-products form. Implement both F and F with NAND gates, and connect the two circuits to the same input switches, but to separate output indicator lamps. Obtain the truth table of each circuit in the laboratory and show that they are the complements of each other