2. (a) Work out the multi-level carry lookahead scheme for doing a 32-bit number addition by 2 methods. (i) 8 numbers of 4-bit carry lookahead adders. (ii) 4 numbers of 8-bit carry lookahead adders. How many gate delays are required to do the complete addition in each of the above 2 methods? (b) For an 8-bit word 00110011 that uses the Hamming code, the check bits stored would be 0101. Suppose when the word is read from memory, the check bits are calculated to be 0110. What is the data word that was read from memory?