Simplify the following Boolean function using a Karnaugh map and determine the minimum sum of products and the minimum product of sums.
F = å
m(3,4,13,15) + d(1,2,5,6,8,10,12,14)
Verify your answer using EWB.
Draw the circuits using all NAND gates and all NOR gates.
Implement the minimum sum of products on a breadboard.
Verify the operation of your circuit and have your lab signed off.