4. Is it possible to represent the number -312 in 8-bit 2s complement? If yes, whats your answer (in binary)? If not, why? 5. Work on the following problems in the B&O textbook (chapter 2, pages 128-129). Show your work in detail. 2.59, 2.61

Write a C expression that will yield a word consisting of the least significant byte of x and the temaining bytes of y. For o'perands x=089ABCDEF and y=0x76543210, this would give 0765432EF. 2.61 Write C expressions that evaluate to 1 when the following conditions are true and to 0 when they are false. Assume x is of type int. A. Any,bit of x equals 1 . B. Any bit of x equals 0 . C. Any bit in the least significant byte of x equals 1 . D. Any bit in the most significant byte of x equals 0 . Your code should follow the bit-level integer coding rules (page 128), with the additional restriction that you may not use equality (==) or inequality (!=) tests