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 of Minterms: Sum-f (A, B, Cin) = Cout-f (A, B, Cin) A* B* Cin + 2.b) 121 Optimize the above functions using K-maps: Sum = f (A, B, Cin) = Cout-f (A, B, Cin) Cin00 0 11 10 00 01 1 10