Using the truth table, prove the following expressions are equivalent: (a) (AB)' = A' + B' (b) (BC' + A'C)' - AB' + AC + B'C'

Question 7: Using the laws of Boolean algebra, convert the following expressions into simplest form: (b + c')' (w'y + z)" (b(ad + c))' ((wx + y)'(wy + z'))'

: Simplify the following Boolean expressions to a minimum * :number of literals F = abc + (a + c) + ābc

F= (~A xor ~B) or ~CF= ~A or ~B or ~CF= ((~A or B) and (~A or ~B)) or (C+~A) Use the functions above to create digital circuits.2- Use Boolean Algebra to simplify the following functions.F= (~A+B) (A+B)(C+A)F= ABC+ A(~B+~C)+C(A+B)F=(A+B)(A+C)(B+C)