Project 1: The following truth table is for output functions D and B.

Bin	X	Y	D	B
0	0	0	0	0
0	0	1	1	0
0	1	0	1	1
0	1	1	0	0
1	0	0	1	1
1	0	1	0	0
1	1	0	0	1
1	1	1	1	1

Derive the Boolean expressions for D and B as Sum of Minterms.

Simplify the expressions. (If Possible)

Using Boolean Algebra

Using Karnaugh Maps

Design the circuit using only NAND gates from the simplified boolean expression.

draw the schematic entry of the circuit.