Address decoder with NAND gates Figure E11.9 shows an N = 3 address decoder and corresponding truth table.
a. Obtain the (optimal) Boolean expression for each output (Karnaugh maps can be helpful).
b. Implement the circuit using only NAND gates (plus inverters, if necessary).
![2032_fa44f032-cb24-4565-a674-1cd0c228986d.png](https://secure.tutorsglobe.com/CMSImages/2032_fa44f032-cb24-4565-a674-1cd0c228986d.png)