1. The problem statement, all variables and given/known data A 7-segment display is used to show a decimal digit and it is driven from 4-bit input. Each bar is assumed to light up when a logical 1 is applied to it. Draw the truth table to drive segment (d) of the display. Using the truth table you have obtained, draw a Karnaugh map to find the minimised logic expression in the 1-st canonical form (SOP, i.e. series of AND terms ORed together). Convert the expression from 2 to a function which uses only NAND gates and draw the equivalent circuit diagram in Logic Circuit and generate its truth table to compare with 1. 2. Relevant equations De-Morgan's laws:$$(A + B)' = A' \cdot B'$$$$A' + B' = (A \cdot B)'$$ 3. The attempt at a solution See attached for truth table and k-map. Canonical Form:$$A + C'D + CD' + A'B'$$ Applying De-Morgan's Theorem:$$A'BCC'DD'$$ but since ##C \cdot C' = 0## and ##D \cdot D' = 0## then this all reduces to 0. I'm not sure whether it is my K-Map minimisation or application of De-Morgan's laws that is wrong?