Using Boolean Algebra Perform the following: Using switching algebra, simplify the following expressions: (b) f(A, B, C, D. E) = (AB + C + D)(C + D)(C + D + E) 2. Simplify the following switching functions (a) f(A, B. C. D)-(AC+D(B+C(A+B+DB+CB+C+D (b) f(A, B,C, D) = AB + AD+BD+AB+CDA+AD+CD+ABD (c) f(A. B. C. D)-ABC AB +ABC + AC + ABC (d) f(A. B. C) (B +A)(AB+ C) +ABA + ABC+(A+ B)(A + C) (e) f(A, B, C) (A + B)(A + B)(A + B + ABC) + (A + B)(A + C) 3. Simplify the following switching functions and implement using NAND only gates (a) f(A, X, Z) x(X + Z) + A + AZ (e) f(a, y,z) -y(z+yx) + yz Using Boolean Algebra Perform the following: Using switching algebra, simplify the following expressions: (b) f(A, B, C, D. E) = (AB + C + D)(C + D)(C + D + E) 2. Simplify the following switching functions (a) f(A, B. C. D)-(AC+D(B+C(A+B+DB+CB+C+D (b) f(A, B,C, D) = AB + AD+BD+AB+CDA+AD+CD+ABD (c) f(A. B. C. D)-ABC AB +ABC + AC + ABC (d) f(A. B. C) (B +A)(AB+ C) +ABA + ABC+(A+ B)(A + C) (e) f(A, B, C) (A + B)(A + B)(A + B + ABC) + (A + B)(A + C) 3. Simplify the following switching functions and implement using NAND only gates (a) f(A, X, Z) x(X + Z) + A + AZ (e) f(a, y,z) -y(z+yx) + yz