(c) (2 marks) Give a truth table for a 1 bit full adder. (d) (2 marks) Give a diagram showing how a ripple carry adder capable of adding two 4 bit binary numbers a3a2aja, and b3b2bibo can be constructed from 1 bit full adders. Your diagram should clearly show the inputs and outputs of each 1 bit full adder and the connections between them. (e) (2 marks) Give a minimal logic equation in sum-of-products form for G=(A.B).(A+B)