Q1) Perform the following computations: a. Convert the unsigned numbers (110101)2, (FB)6 to their decimal equivalent. b. Convert the unsigned numbers (36)s, (AD3)16 to their binary equivalent. C. Convert the unsigned binary numbers (110001011)2, (10110010)2 to their octal and hexadecimal d. Convert the signed decimal numbers +56, -78 into signed 8-bit numbers in the sign-and-magnitude, equivalent. 1's complement and 2's complement representations e. Convert the 2's complement numbers (01101111)2, (10011010)2 to their decimal equivalent. Q2) Perform the following computations involving 8-bit numbers in 2's complement representations and indicate whether an arithmetic overflow occurs. a. 00110110 01000101 b. 11010110 11101100 Q3) Design 3-bit ripple-carry adder and carry-look-ahead adder. Compare between the two designs by finding the delay (assume the delay for each component is (Hint: use figure 3.14 & 3.17) Q4) Perform the following computations a. 01101 x 01010 b. 10011 x 01111 (signed number) Q5) Design the following function f(wi, wy, w) m(0,2,3,4,5,7) using a. 3-to-8 decoder and OR gates b. 2-to-1 multiplexer using shannon's expansion (expand on w) c. 4-to-1 multiplexer using shannon's expansion (expand on wz,Wa) 6) Design 4-to-16 Decoder using 3-to-8 Decoder Q7) Derive the Boolean equations for a 4-to-2 priority encoder with i, i, i, io as inputs and y, y, z as outputs. Assume that io has the highest priority and is has the lowest priority. Show all your work