1. Consider a 2s complement 8-bit representation. A binary number has a value of -105 when we regard it as a signed number. What is its value if we regard it as an unsigned number? 2. Consider a 2s complement 8-bit representation. What is the value of 1001 1110? 3. Simply the boolean expression x' + xy + xz' +xy'z'. What is the simplest result ? 4. Simplify ( x + y )'(x' +y'). What is the simplest result ? 5. Simplify x* (x+y+z)*(x+y)*(x+q)*(x+q' + z). 6. Simplify x*(x+y+z) * (x'+z) * (y +z')*(x+z) 7. Write the boolean expression (in sum-of-product form ) for a logic circuit that will have a 1 output when x = 0, y = 0, z = 1 and x= 1, y = 1. z=0; and a 0 output for all other input states. Draw the circuit for the simplified expression. 8. Simplify the expression xyz ( xyz' + xy'z + x'yz). 9. Using maps or whatever method you prefer, simplify the following expressions in four variables, w, x, y and z: (0,2,4,8,9,10,11,12,13) 10. (15 points) Write verilog modules and a test bench to check whether your simplified expressions of question 5 and 6 are correct. Use both the structural description and behavioral description (or dataflow modeling)