In the Logisim tutorial, you made a circuit that outputs an XOR value. That circuit was made using OR, AND and NOT gates. Due to rules of logical equivalence, it is possible to build any circuit using only NAND gates. For this challenge problem, make a circuit that is logically equivalent to ¬((A∧B)∨C) using only NAND gates.
Given F = ¬[(A <img alt="\wedge" src="https://studymeta.oss-cn-hongkong.aliyuncs.com/8/87e3887c4b555855e809c04a64f3b6d6.jpg" aria-describedby="ed5"> B) VC]F = [¬(A <img alt="\wedge" src="https://studymeta.oss-cn-hongkong.aliyuncs.com/8/87e3887c4b555855e809c04a64f3b6d6.jpg" aria-describedby="ed5"> B) /_\ ¬C]  {By De Morgan's law ¬ (P V Q) = ¬P Lambda ¬Q }F =¬{¬[¬(A <img alt="\wedge" src="https://studymeta.oss-cn-hongkong.aliyuncs.com/8/87e3887c4b555855e809c04a64f3b6d6.jpg" aria-descri ... See the full answer