5. (15 pts) Simplify the following Boolean equations using Boolean theorems. For each step in the minimization process, show which theorem/rule was used to get there. a) Y (B+AC)(B+D) b) Y#ABC + AB c) Transform the following Boolean equation in SOP form to POS form: Y t: AB + C + AD 6. (8 pts) Transform the following Boolean equation to an equation that only has NOT gates and/or NAND gates. Then, draw a logic circuit diagram of the Boolean equation by using only 2- input NAND gates: F(A,B,C)-(B +C) (A + B + C)