b) one simple way to model time for logic is assume each AND or OR gate takes the same time for a signal to pass through it. Time is estimated by simply counting the number gates along the path through a piece of logic what is the number of gate delays between a carry in to the least significant bit and the carry out of the most significant bit of a 8-bit ripple carry adder by using the FA from (a)? what is the number of gate delays between a carry in to the least significant bit and the carry out of the most significant bit of a 8-bit carry lookahead adder by using the modify (bring out propagate and generate) FA from (a) and two-level carry lookahead ? Hint textbook p.B-46 example