Simplify the expression $(x)$ from problem $1$ by using Boolean Algebra. Show all work

Combine $A^{\text{'}}B{C}^{\text{'}}+A^{\text{'}}BC$

$=A^{\text{'}}B+A{B}^{\text{'}}C+AB{C}^{\text{'}}+$ABC

Combine ABC $++$ABC

$=A^{\text{'}}B+A{B}^{\text{'}}C+AB$

$AB+A^{\text{'}}B$

$=B+A{B}^{\text{'}}C=B$

The simplified Boolean expression is B

$4.$ Simplify the expression $(x)$ from problem $1$ by using a Karnaugh map. Show all work

$A\frac{B}{C},0,1,{11}_{,}10$

$0,0,0,0,0$

$1,0,1,1,1$

$11,1,1,1,1$

$10,0,1,0,1$

The Karnaugh map confirms that the expression simplifies to B $,$ as all

$5.$ Implement the simplified expression from questions $3$ and $4$ by drawing a digital logic circuit using NAND gates only.

$*$I need help with question #$5*$