1. Implement the carry-out and sum functions for a 1-bit full adder using a 3-to-8 decoder block with active-low outputs and additional gates (what gate types should be used).
Complete the truth table and draw the circuit diagram
Inputs: Outputs:
Cin A B Cout S
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
2. Implement the following function with a 3x8 decoder with active-high outputs and a input logic gate
F(A,B,C)=S(0,1,2,3,4)