A/B/6 y-output dware & Architecture HW #6 Bit (LSB) must be tested. 6. (6 Pts - 3 Pts Each) To determine whether a binary number is Odd or Even, the Least Significant a. Assume only Exclusive-OR Gates are available, design and sketch a simplified circuit to output a 1 if the binary number is Even and a 0 if the binary number is Odd. b. Then design and sketch the circuit assuming only Exclusive-NOR Gates are available. 7. (8 Pts) For the following Truth Table, se a K-Map to derive a minimum Boolean expression for the Expression output. Draw the logic circuit. Label the output of each gate and the final output with a Boolean Inputs Output Y A B C D 0 0 0 0 X 0 0 0 1 0 0 0 1 0 0 0 1 1 0 1 0 0 000 0 1 0 1 0 0 1 1 0 I 0 1 1 1 1 1 0 0 0 1 1 0 0 1 1 1 0 1 0 X I 0 1 1 X 1 1 0 0 X 1 1 0 1 X 1 1 1 0 X 1 1 X 8. (9 Pts - 3 Pts Each) Apply DeMorgan's Theorem for NAND gates and use only 2-Input NAND Gates to a. Create and sketch a simplified circuit with AND gate functionality. b. Prove the function of your design using DeMorgan's and/or other Boolean Theorems. c. Prove the function of your design using Truth Tables rdware & Architecture HW #6 4. (4 Pts) Use a Karnaugh Map to complete the simplification of the Boolean Expression in the previous question. AB CO 이 B 01 0 5. (8 Pts) Use a Karnaugh Map to derive the Minimum Boolean Expression that will implement the following Truth Table. ("x" Don't Care) Sketch the logic Circuit, providing an intermediate expression for the output of each gate used and the final output. Inputs Output A B C D Y 0 0 0 0 1 0 0 0 1 0 0 0 1 0 1 0 0 1 1 0 0 1 0 0 1 0 1 0 1 X 0 1 1 0 1 0 1 1 1 0 1 0 0 0 1 1 0 0 1 0 1 0 1 0 X 1 0 1 1 1 1 1 0 0 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0