2.Given the following bit patterns in memory,

1000 1111 1010 1111 1100 0000 0000 0000

0000 1111 1010 1111 0011 0000 0000 0000

2a. Provide the ones-complement of the first bit pattern.

2b. Provide the result of bit-by-bit NANDing the two bit patterns.

2c. Provide the result of bit-by-bit NORing the two bit patterns.

2d. Provide the result of bit-by-bit XORing the two bit patterns.

2e. Provide the sum for the two-bit patterns if they represent unsigned integers (Is there an overflow?)

2f. Provide the sum for the two-bit patterns if they represent 32 bit IEEE floating point numbers. (Is there an overflow?)