A full adder is a circuit which adds three bits X, Y, Z together and returns two bits C and S to represent the total as a 2-bit binary number C S. C is the MSB and S is the LSB. For example, if X=1, Y=1, Z=0, the total should be 2, or 102 in binary. Hence C=1 and S=0. Write the truth tables for the functions C and S.