Problem: For a 2-bit adder with 2 operands A, B where each operand is a 2-bit operand and with carry-in bit into stage 0, C0, how many inputs and outputs does the adder have? Briefly explain.
You will need two K-maps, one for the sum output, and another for the carry-out output. Form the K-maps and give the minimized equations for the sum and carry-out in sum-of-product forms (recall a sum-of-product form of a Boolean function is the ORs of terms, where each term is an AND of literals; the sum-of-product form does not include the XOR operator). In forming the K-maps from the truth table, assume the inputs to the adder are Ai, Bi, Ci with the adder outputs: Si for sum and Ci+1 for the carry-out outputs.