T Thask $2$

We will now build optimized circuits for both co and s$.$

There are two ways to do this:

Build a sum of minterms, using terms corresponding to rows in the truth table where the output is$,$ then,

simplify using Boolean algebra.

OR

Build a Karnaugh $($K$-)$map$,$ and find minimum covers. Note: K$-$Maps only apply the distributive, complement

and identity properties. It is possible you can simplify further using Boolean algebra even after applying the K$-$

map $($and you should$).$

Your task is to do the above and compute the simplest boolean expression for co and s$.$ Once you

have these, draw the corresponding optimized circuit schematic. You may work digitally or on paper.