URGENT PLEASE PLEASE HELP

Problem 1 (15 points) 1. (3 each) Give the base 10 integer equivalent of each of the following. Assume these hexadecimal numbers represent numbers stored in 16-bit two's complement: a. 0x90AS b. 0x3A23 2. (3 each) Give hexadecimal numbers representing the following base 10 numbers, as stored in 16-bit two's complement: a. 4376 b. -8456 3. (3 points) Write a mask (in hexadecimal) to give the value of the lowest 11 binary digits of a 16-bit integer Problem 2 (10 points) You are trying to reconstruct a sequence of 12 bits (cal it 'a) where the middle four bits are missing. You know that in hexadecimal, the sequence is "D 9" where " represents the missing bits. You also have the octal (base 8) representation of the bitwise operation NOT(a), which is "_26 " where two digits are missing from this number. Give the complete hexadecimal value of a as well as its base 10 equivalent (treat it as an unsigned integer). Problem 3 (10 points) Suppose you are given a positive integer number x. Give a single expression using only bitwise operations, shifts, addition, and subtraction (you may also use parentheses to improve clarity) that finds the value of 6.25 x Problem 4 (30 points) Consider the following two 9-bit floating-point representations based on the IEEE floating-point format: 1. Format A . There is 1 sign bit There are k-4 exponent bits. The exponent bias is'7 e There aren-4 fraction bits. 2. Format B . There is 1 sign bit. . There are k 3 exponent bits. The exponent bias is 3. There are n-5 fraction bits. In the following table, you are given some bit patterns inone of the formats. Convert them to the closest value in the other format. If rounding is necessary, you should round toward +infinity. Also give the values of each of the bit patterms (whole rnumbers or fractions). Fomnat A Format B Bits 00011 1000 1 1000 0010 00110 0011 Value Bits 0 000 11000 1 100 00100 Value 3/32 3/32 11/2 0 101 01011 1001 01010 0 011 10111 43/8