Help please

Problem D. Consider the following two single precision bit patterns: 1 01111110 10001000000000000000100 1 10000001 11111100000000000000010 Perform binary addition of these 2 numbers following the algorithnm for floating point addition given on slides E 25&26. Show all steps in your calculation. Floating Point Addition Start 1. Compare the oxponents of the two numbers; shift the smaller number to the right until its exponent would match the larger exponent 2. Add the significands 3. Normalize the sum, either shifting right and incrementing the exponent or shifting left and decrementing the exponent Yes Overflow or underflow? No Exception 4. Round the significand to the appropriate number of bits No Still normalized? Yes Dono Floating Point Addition (cont.) Operands: (-1)51 M1 x 251 (-1)s2 M2 x 2E2 Assume: E1> E2 Exact Result.(-1)" M 2E Sign s & significant M: (-1)51 M1 (-1)2 M2 result of signed align & add Exponent E: E1 Fixing If M 2 2, shift M right & increment E if M