Logic Design

2) [20] The following truth table represents a Full Binary Adder. The two binary inputs are A and B and the carry from previous stage is Cin. The sum bit is S and the carry for the next stage is Cout. Cin Sum Cout 2.a) [2] Write the Boolean expression as a sum ofMinterms: Sum-f (A, B, Cin) Cout (A, B, Cin) 2.b) [2] optimize the above functions using K-maps Sum-f (A, B, Cin) Cout (A, B, Cin) 00 01 11 10 00 01 11 10