1. Single-bit full adder. Show the truth table of C (carry) and S(sum) of single-bit adder with input X, Y and Cin (carry-in) simulating the single-bit binary arithmetic addition. Show the sum of min-term expression of C and S. Implement the single-bit full adder on Logic Works using the following Boolean expressions: C = XY + Xcin + Yin S = x Y Cin Show the testing of your single-bit full adder. (You need to test and show all 8 input cases.) Pack your single-bit full adder and name it as fa-1. Show the testing of your packaged single-bit full adder