Perform the following simplifications using K-Maps. Draw the resulting circuits. Show the steps in every exercise. Simplify the following Boolean expressions to a minimum number of literals: (a) xy+xy (b)(x+y)(x+y) (c) xyz+xy+xyz (d)(A+B)(A+B) (e) (a+b+c)(ab+c) (f) abc+abc+abc+abc Simplify the following Boolean expressions to a minimum number of literals: (a) ABC+AB+ABC (b) xyz+xz (c) (x+y)(x+y) (d)+xy+x(wz+wz) (e) (BC+AD)(AB+CD) (f) (a+c)(a+b+c) Reduce the following Boolean expressions to the indicated number of literals: (a) AC+ABC+AC to three literals (b) (xy+z)+z+xy+wz to three literals (c) " AB(D+CD)+B(A+ACD) to one literal (d) (A+C)(A+C)(A+B+CD) to four literals (e) ABCD+ABD+ABCD to two literals Perform the following simplifications using K-Maps. Draw the resulting circuits. Show the steps in every exercise. Simplify the following Boolean expressions to a minimum number of literals: (a) xy+xy (b)(x+y)(x+y) (c) xyz+xy+xyz (d)(A+B)(A+B) (e) (a+b+c)(ab+c) (f) abc+abc+abc+abc Simplify the following Boolean expressions to a minimum number of literals: (a) ABC+AB+ABC (b) xyz+xz (c) (x+y)(x+y) (d)+xy+x(wz+wz) (e) (BC+AD)(AB+CD) (f) (a+c)(a+b+c) Reduce the following Boolean expressions to the indicated number of literals: (a) AC+ABC+AC to three literals (b) (xy+z)+z+xy+wz to three literals (c) " AB(D+CD)+B(A+ACD) to one literal (d) (A+C)(A+C)(A+B+CD) to four literals (e) ABCD+ABD+ABCD to two literals