orm the following additions and subtractions of the following unsigned integers. Use the fewest number of bits n to represent both PROBLEM 3 (38 PTs) there is an overflow. For the subtraction, eato.Indicate every carry (or borrow) from co to Cn (or bo to bn). For the addition, determine whether determine whether we need to keep borrowing from a higher byte. (8 pts) Example (n-8): 77 194 3 77 = 0x4D 0 1 0 0 1 1 0 1- 54 0x36 0 0110 1 1 0 210 0xD2 11010010 194 = 0xC2-11000010 0000 1011 Overflow! 1 0 0 0 0 1 0 0 0 271 137 111 +75 43 97 128 43 b) We need to perform the following operations, where numbers are represented in 2s complement: (24 pts) 99 62 -97 +256 413617 -12226 . For each case: -127 37 -2-64 Determine the minimum number of bits required to represent both summands. You might need to sign-extend one of the summands, since for proper summation, both summands must have the same number of bits. Perform the binary addition in 2's complement arithmetic. The result must have the same number of bits as the summands. Determine whether there is overflow by: i. Using Cn-1 (carries). i. Performing the operation in the decimal system and checking whether the result is within the allowed range for If we want to avoid overflow, what is the minimum number of bits required to represent both the summands and the c) Get the multiplication results of the following numbers that are represented in 2's complement arithmetic with 4 bits. (6 pts) n bits, where n is the minimum number of bits for the summands. result? 0100x0101, 1000x0110, 1001x1001