Write the Boolean expression for $Y.$

For the following Boolean expression, draw the truth table, and then draw the circuit diagram $F=(A^{\text{'}}B+B^{\text{'}}C)$

Draw the logic diagram for the AND, OR$,$ and NOT gates, then implement each of them using only NAND gates.

$3$

Lab $1$

Spring $2023$

CS $2614$

Using the NAND gate equivalents in Problem $3,$ redraw the circuit of Problem $2$ using only five NAND gates.