A full adder has inputs a, b, ci and outputs co, s The equations for the carry and sum outputs of a full adder may be specified as co-ab +ci a + ci b s-ci' a' b + ci' a b' +ci abci a b. 1. (10 points) Using the properties of Boolean algebra, show that: co-ci(a + b) + abs-abci ( a + b + ci) col 2. (10 points) How many transistors would you save in a CMOS implementation of a full adder by taking advantage of the transformed equations from Problem 1 vs. implementing the circuit directly using the original equations? Express your answer as a percentage reduced transistor count / original transistor count You don't need to include an actual circuit schematic in your solution, but you do need to include enough of an explanation of your reasoning to convince the graders that you know what you are doing. Be sure to include any inverters that you may need on either the primary inputs or on the outputs in your design