Word Processor all answers (the tables in question 5 can be hand drawn). Each part of each problem (e.g, 1a,1b,2a,3b, etc) is worth 5 points. Show your work for a chance at partial credit - if you don't show your work and you get an answer wrong, you get it all wrong! NOTE: remember to include minus signs for any negative numbers in 1,2 and 6 . 1. Convert 11101000 to decimal assuming the number is stored in each of the following representations: a. Unsigned magnitude b. Signed magnitude c. One's complement d. Two's complement 2. Convert 1000011110010110 to decimal assuming that the number is stored in a. Signed magnitude b. Two's complement 3. Convert 10208 from decimal to each of the following binary representations a. 16-bit signed magnitude b. 16-bit one's complement c. 16-bit two's complement 4. Perform the following binary subtraction problem by converting the second number into its two's complement negation and adding the results together. Both numbers are two's complement so ignore any carry out produced by the addition. 0111000000100101 5. Do the following binary multiplication and division problems. Use the tabular approach (as covered in class, see the sample problems on the web site and power point notes). If you do not show the work via the tabular approach, you will get no credit. For a, d \& e, the numbers are unsigned magnitude. For b \& c, the numbers are two's complement. The multiplication problems use 5-bit numbers and the division problems use 6-bit numbers. a. 0011111011 (use the unsigned multiplication algorithm) b. 1100101010 (use Booth's algorithm) c. 1011011100 (use Booth's algorithm) d. 111010/001101 (use the unsigned division algorithm) e. 101001/000101 (use the unsigned division algorithm) 6. Using the 14-bit floating point representation from chapter 2 (figure 2.2) where exponents are represented using excess- 16 , convert the following a. 01100110001001 to decimal b. 4.34375 to binary c. 10111011010000 to decimal d. 20.9 to binary 7. Assume we are using even parity. We have a byte of 00000000 and a parity bit of 0 . Is there an error? Yes, no or uncertain? Explain