$\backslash$table$[[$Cin$,$A$,$B$,$Sum,Cout$],[0,0,0,0,0],[0,0,1,1,0],[0,1,0,1,0],[0,1,1,0,1],[1,0,0,1,0],[1,0,1,0,1],[1,1,0,0,1],[1,1,1,1,1]]$

Use Table $1$ to generate a Boolean equation for Sum and Cout $($Carry$).$ Then minimize the equation by using two Karnaugh maps $($You will need one K$-$Map for each of Sum and Cout$)$ as shown in Figure $1.$ Design an appropriate logic circuit for the $1-$bit full adder using the smallest number of logic gates.