plz do both the parts

1. Simplify the following Boolean expression as much as possible, using the postulates and theorems of Boolean algebra. Show every step of simplification. (a) RA, B, C)-ABC+ AB+ AC+ ABC (b) fA.B.C-(A B CA+A+C) ot (c) f(A,B,C) A(A+ BC) + A(B +c) a/h (d) fA,B.C)- (AXA + B)+ (B + AA B) (e) f(A,B,C) (AB)(A + B)(B+B) (f) f(A,B,C,D)- (BC+ AD) (AB + CD) (g) f(A,B,C) = (A + B) (A+ B) 2. Implement the following functions using minimum number of two in put NAN Draw the gate level diagram (a) F = AB + CD (b) F=(X+Y) (Z+W) (c) F ABOC (d) F= AB + AB