a) Draw the multilevel primitive AND/OR/NOT implementation of the circuit which implements the following Boolean fucntions
W=A+BC+BD
X=B'C+B'D+BC'D'
Y=CD+C'D'
Z=D'
b) use technology mapping to convert the primitive circuit to a circuit using only NAND and NOT gates. The NOT gates must be a single input, the NAND gates may be any number of inputs. Show the interim circuit diagram(s) and circle the redundant NOT gates, then show your final circuit.
c) Use technology mapping to convert the primitive circuit using only NOR and NOT gates. The NOT gates must be single input, the NOR gates may be any number of inputs. Show the interim circuit diagrams(s) and circle the redundant NOT gates, then show your final circuit.