Design a combinatorial circuit that looks at its BCD input and its output is true when the input combination is divisible by 3 (0 is considered divisible by 3). (Note: In BCD 0—9 are valid No. 10—15 are don’t care No) Construct the truth table for the valid BCD No. Assume that the 4-bit input binary number is A, B, C, D and the output is F. Obtain simplified expression for the output f in SOP form using K-Map. Draw logic diagram for the simplified expression of the function

Design a combinatorial circuit that looks at its BCD input and its output is true when the input combination is divisible by 3 (0 is considered divisible by 3).

(Note: In BCD 0—9 are valid No. 10—15 are don’t care No)

1. Construct the truth table for the valid BCD No. Assume that the 4-bit input binary number is A, B, C, D and the output is F.

1. Obtain simplified expression for the output f in SOP form using K-Map.
2. Draw logic diagram for the simplified expression of the function
3. Simulate your logic diagram using dataflow coding and Modelsim software to verify that your design works correctly according to specifications. Show your simulation.
4. Implement your logic diagram using gates on Multisim software also.