Full-adder Truth Table input output 0 0 This leaves two tasks for you to complete 1. create SOP expressions for the carry out (Cout) and the sum (S) create circuit diagrams for the the carry out (Cout) and the sum (S) based on your SOP expressions. They will not be the optimum circuits because we did not reduce the expressions, but they will be correct 2. Here is one version of what an optimized full-adder circuit looks like carry-block out In this circuit, the sum = A xor B xor Cin, while the carry out - ((A xor B) and Cin) or ((A and B))