HELP!! ASAP!!

1. Work on the following boolean equations (2.5pt). A. Using algebraic manipulation to prove: A(A+B)(AB+C)(ABC+D)=ABCD B. Transform to only using NOT and OR: ABC+CD C. Simplify using algebraic manipulation: XY+XYZ+XY D. Simplify using algebraic manipulation: A+B+CABC 2. Optimise the following boolean functions using a K-map (2.5pt), then implement the circuit in logic works as circuit2a.cct and circuit2b.cct. You must clearly label your input according to the variables here, and you must clearly label your output prob as F. A. F(A,B,C,D)=m(2,3,8,9,10,12,13,14) B. F(A,B,C,D)=m(1,3,6,7,9,11,12,13,15) 3. Optimise the following boolean expressions in Product-of-Sums form. (2.5pt) A. F(A,B,C,D)=m(0,2,3,4,8,10,11,15) B. F(W,X,Y,Z)=M(0,2,4,5,8,10,11,12,13,14) 4. The denotation of don't care condition is d(A,B,C,D)=m() complimenting the boolean function F. Optimise the following Boolean function F together with the don't care condition d. (2.5pt) Implement the two boolean expressions in LogicWorks, save as circuit4a.cct and circuit 4b.cct. You must clearly label your input according to the variables here, and you must clearly label your output prob as F. A. F(A,B,C,D)=m(0,1,7,13,15),d(A,B,C,D)=m(2,4,6,8,9,10) B. F(A,B,C)=m(1,2,4),d(A,B,C)=m(0,3,6,7)