solve this with more steps for every one

Question 01 ClO1 (2pts. a. You are asked to complete the following table by converting the decimal numbers to their corresponding forms. Use the minimum number of digits, and without using calculators. b. Complete the following table with equivalent numbers using conversion techniques (without calculators). Question 02 (2 pts.) Using the method of repeatedly dividing by 2 , find the equivalent 8-bit signed binary number of each of the following decimal numbers. Inchude all solution steps. Consider X,Y and Z that already given in the 2 's complement as 8-bit signed binary numbers: X=11101011,Y=11111011,Z=01101110. It is required to compute the addition F=X+Y and the subtraction E=XZ using only 2 's complement binary forms (Note: No need for conversion to decimal values and no need for calculators). a) Compute F showing your solution steps. Does an overflow occur? ( 1.0 point) b) Compute E showing your solution steps. Does an overflow occur? (1.0 point) a) F(A,B,C)=AB+AB+AB+AB+ABC b) F(X,Y,Z)=XY+XZ+Y+YZ Question 05 CLOs 2,3 (1+1:2pts. a) Simplify the following Boolean function using Karnaugh-map method? (show all steps) b) Draw the circuit using the basic gates F(X,Y,Z)=(0,2,4,6,7)