Design a full adder that takes two $1-$bit inputs $(x$ and $Y,$ or A and $B)$ to represent the two significant bits to be added and another input $,$ or $C_{in})$ to represent the carry from the previous lower significant position. The outputs will have two bits $(C_{\text{o}\text{u}\text{t}}$ and $S).$

Include the following in your lab report:

Truth table by hand.

K$-$maps by hand $($there will be $2$ K$-$maps: one for output $S$ and one for output $C_{\text{o}\text{u}\text{t}}).$

Simplified logical expressions $($simplify as much as possible$).$