3. "1111" For the following schematic. Carry Save wiring, use a, b. e and f all as four ones, eg. a a) what is the six bit result s. b) given that the time from any input to any output in the full adder is 3T, how much time does the longest etc. path require? The answer is full adder e1 - cout cin s5 34 s3 s2 s1 Carry Save wiring