Using Boolean Algebra Perform the following: Using switching algebra, simplify the following expressions: (a) f(w, x, y. z)-x +xyz+xyz + wx +ux +xy (b) f(A, B, C, D, E) (AB + C + D)( + D)(C + D + E) 2. Simplify the following switching functions: Simplify the following switching expressions. (a) f(A, B. C. D)- (A +C+D(BC(AB+D(B +C)(B+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 + AB (d) f(A, B. C) (B A)(AB+C)+ABA ABC (A B)(A C (e) f(A, B, C) ( + B)(A + + B + ) + (A + B)(A + C) 3. Simplify the following switching functions and implement using NAND only gates Simplify the following switching expressions (a) f(A, X, Z)-X(X + Z) + A + AZ 4. Find the minimum equivalent circuit for the following circuit f(A, B, C, D)