Simplify the following Boolean function using a Karnaugh map and determine
the minimum sum of products and the minimum product of sums.
F = AB' + ABD + A'C'D' + A'BC' + ABD'
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.