7 points) For cach (sub-part, door answer the following Show how you would add the two 8-bit binary numbers by filling in each of the blank boxes with a or 1 NOTEL: Addition of 2's complement numbers is done just like the addition of unsigned whole numbers, so you only need to NOTE2. There are blank boxes for the Carry bits and blank boxes for the Sun bits CAUTION: Every blank box should be filled with a 1; if you leave any boxes blank you risk incutting penalty Circle one observation from the list below that is applicable and useful to help determine whether overflow has occurred, if the numbers are signed whole numbers and only & bits are available for holding the result CAUTION: There will be penalty for additional observations circled that are not applicable helpful . Circle Yar N to indicate your inference on whether overflow has occurred or not (if the numbers are signed whole numbers and only 8 bits are available for holding the result) based on the circled observations) . Circle the observations from the list below either of which is applicable and useful to help determine whether overflow has occurred, if the numbers are complementer and only * bits are available for holding the result. CAUTION. There will be penalty for observations circled that are not applicable helpful. Circle Y or N to indicate your inference on whether overflow has occurred or not (if the mumbers are 2's complement number and only 8 bits are available for holding the result) based on the circled observations List of observations --cach is in terms of the state(s) of certain bitts) in 1 ve 2 positions - good for hardware implementation) (A) Carry-out is when bits at most significant-bit positione added (6) Carry-out is 1 when bits at most-significant-but position are added (C) Addends have opposite signs (0) Addends are both positive, sum is positive (E) Addends are both positive, sum is negative (F) Addends are both negative, sum is positive (6) Addends are both negative, sum is negative (H) Carry-in and carry out at most significant-bit position are the same (1) Carry-in and carry-out at most significant-bit position are not the same (a Carry Chrvatim iftaru!! Overflow --cie only 1) 1111 Othervations if complet. CID UI/1) Yo-circle exactly 23 Overflow (only ) Overflow 11111 ale exactly Observation_c./CITISH/D) Overflow Curry +/F/G/H/ cinde only 1) Charation is agr ( 4 / Overflow -- circle ccthy 2) Overflow from? 10 Obarvatice i upot: (/*/EDISINI) Overflow ini? --cinc only 11111111 (cinde cuatly23 Overflow if .com 7 points) For cach (sub-part, door answer the following Show how you would add the two 8-bit binary numbers by filling in each of the blank boxes with a or 1 NOTEL: Addition of 2's complement numbers is done just like the addition of unsigned whole numbers, so you only need to NOTE2. There are blank boxes for the Carry bits and blank boxes for the Sun bits CAUTION: Every blank box should be filled with a 1; if you leave any boxes blank you risk incutting penalty Circle one observation from the list below that is applicable and useful to help determine whether overflow has occurred, if the numbers are signed whole numbers and only & bits are available for holding the result CAUTION: There will be penalty for additional observations circled that are not applicable helpful . Circle Yar N to indicate your inference on whether overflow has occurred or not (if the numbers are signed whole numbers and only 8 bits are available for holding the result) based on the circled observations) . Circle the observations from the list below either of which is applicable and useful to help determine whether overflow has occurred, if the numbers are complementer and only * bits are available for holding the result. CAUTION. There will be penalty for observations circled that are not applicable helpful. Circle Y or N to indicate your inference on whether overflow has occurred or not (if the mumbers are 2's complement number and only 8 bits are available for holding the result) based on the circled observations List of observations --cach is in terms of the state(s) of certain bitts) in 1 ve 2 positions - good for hardware implementation) (A) Carry-out is when bits at most significant-bit positione added (6) Carry-out is 1 when bits at most-significant-but position are added (C) Addends have opposite signs (0) Addends are both positive, sum is positive (E) Addends are both positive, sum is negative (F) Addends are both negative, sum is positive (6) Addends are both negative, sum is negative (H) Carry-in and carry out at most significant-bit position are the same (1) Carry-in and carry-out at most significant-bit position are not the same (a Carry Chrvatim iftaru!! Overflow --cie only 1) 1111 Othervations if complet. CID UI/1) Yo-circle exactly 23 Overflow (only ) Overflow 11111 ale exactly Observation_c./CITISH/D) Overflow Curry +/F/G/H/ cinde only 1) Charation is agr ( 4 / Overflow -- circle ccthy 2) Overflow from? 10 Obarvatice i upot: (/*/EDISINI) Overflow ini? --cinc only 11111111 (cinde cuatly23 Overflow if .com