How do I solve these ?

1. Represent the decimal number 347 in a) BCD b) ASCII (assume 8 bit per-character representation, where the MSB is zero) 2. Simplify, using Boolean algebra, express as a minimum sum of products: a) ABCAB+ABC b) xyz+ x c) (x +y+y d) xy+xiwz + wz) 3. Draw logic gate diagrams for the original and simplified expressions in 2 (a) and (b) above. 4. The following truth table is provided for function F a) Express F in a canonical sum of products in "linle-m" form b) Express F in a canonical product of sum in "big-M form. c) Simplify F to a minimum number of literals using Boolean algebra. 5. Find the complement of F-wxtyz; then show that FF-0and F+F-1 6. For the Boolean function F-xyz+xyz+ wxy+wx'y +wy a) Obtain the truth table of F b) Draw the logic gate diagram, using the original Boolean expression. c) Use Boolean algebra (not K-map) to simplify the function to a minimum number of literals Obtain the truth table of the function from the simplified expression and show that it is the same as the one in part (a). d) e Draw the logic gates diagram from the simplified expression, and compare the otal number of gates with the diagram of part (b). 7. Simplify the following Boolean function using a 3-variable K-map F(A,B,C)--m(0, 1.4 57) 8. Simplify the following Boolean function using a 4-variable K-map: RA.B.CD)- m(3, 4, 6, 7, 12, 14)