[1] Assuming w=4, we can assign a numeric value to cach possible hexadecimal digit, assuming cither an unsigned or a two's-complement interpretation. Fill in the following table according to these interpretations by writing out the nonzero powers of 2 in the summations shown in equations below: B2Tw(x)=xw12w1+i=0u2x,2iB2Uw(x)=i=0n1x2i [2] One useful feature of C is that it supports bitwise Boolean operations, In fact, the symbols we have used for the Boolean operations are exactly those used by C: I for or, \& for and, for not, and for exclusive-or. These can be applied to any "integral" data type. Fill in the blanks for each C expression. Follow the first example for clarification. Show your work. [3] Fill in the table below showing the effects of the different shift operations on singlebyte quantities. The best way to think about shift operations is to work with binary representations. Convert the initial values to binary, perform the shifts, and then convep back to hexadecimal. Each of the answers should be 8 binary digits or 2 hexadecimal digits. [4] We have a machine of 16-bits. This 16-bits machine can be used to represent 216 or 65,536 different values. We have another machine of 32-bits. This 32-bits machine can be used to represent 232 or 4,294,967,296 different numbers. So, if you wanted to store a value of 100,000 then which machine you should choose? The 16-bits machine or 32 -bits machine? Mention and explain your choice. (It's Ok to use Calculator for this problem) [5] We have an 8-bits machine. But we don't know if the machine follows unsigned representation or the two's complement/signed representation. A hexadecimal value is given as OxFI. Find out the unsigned representation of this hexadicemal value in decimal. Find out the two's complement/signed representation of this hexadicemal value in decimal. Instructions: [1] Show your work