P5. (17 pts) Boolean Algebra Circuit. (1) (4 pts) Transform the following Boolean equation in SOP form to POS form: Y = F(A,B,C,D) = B + CD (2) (4 pts) Expand the following Boolean equation into a sum of minterms, where each minterm should have the three input variables in their original or complement forms. Y = F(A,B,C) = AC + AB (3) (5 pts) Simplify the following Boolean equations using Boolean theorems. For each step in the minimization process, show which theorem or axiom or method or definition is used to get there. Y = ABC + B + AC + B (4) (4 pts) Transform the following Boolean equation to an equation that only has 2-input NAND gate(s) and/or NOT gate(s). You are not required to draw a schematic. Y = A + B +C