correctly. Boolean algebra equations to be used for minimization can be seen in the below. 1. Law of Identity 2. Commutative Law 3. Associative Law 4. Idempotent Law 5. Double Negative Law 6. Complementary Law 7. Law of Intersection A = A A = A AB=BA A+B = B + A A. (B. C) = A.B.C A+(B+C) = A+B+C A. A = A A+A=A ANA A-0 A+ = 1 A.1 = A A.0 = 0 A+ 1 = 1 A+ 0 = A AB=A+B A+B= AB A. (B+C) = (A.B)+(AC) A+ (BC) = (A + B).(A+C) A.(A+B) - A A+ (AB) = A A.(A + B) = AB A+(AB) = A+B 8. Law of Union 9. De Morgan's Theorem 10. Distributive Law 11. Law of Absorption 12 Law of Common Identities Examine the following Boolean equation: Y = AB + BCD + ABCD + ACD. Do the following: 1. Using the table below for the equation given, manually determine the output for all the binary input combinations. 5 pts 2. Minimize the equation using the chosen methods (you may need more than one rule) and show your work breaking it down. List the rule you used for each step. 5 pts 3. Manually determine the output results for the minimized equation in the table where shown below as you did for question 1. 4. Convert your minimized equation into a schematic using B2Spice or another schematic program and paste it below. 5 pts