a$)$ Given is the Boolean function:

$x=f(A,B,C)$;$,A,B,C,x,$inB;,$B,B$:$=\{0,1\}$

including the following truth table:

$\backslash$table$[[A,B,C,x,$minterm$],[0,0,0,1,],[0,0,1,1,],[0,1,0,0,],[0,1,1,0,],[1,0,0,1,],[1,0,1,0,],[1,1,0,1,],[1,1,1,0,]]$

Specify the minterms and disjunctive normal form of the Boolean function.

b$)$ Given the Boolean formula as defined in $1.$a$).$

i$.$ Create a K$-$map and derive the disjunctive minimal form $($dmf$)$

ii$.$ Present the dmf as a circuit

iii. Transform the circuit into a circuit which uses only NAND gates