can someone explain step by step solutions on how to do this? im so lost . Thank you in advance . Boolean Algebra

1- In each case, multiply out to obtain a sum of products: Simplify where possible) (b) (A+B+C)(A+D'+C)(C'+A'+D)(B'+A)(D'+A) 2- (a) Reduce to a minimum sum of products (4 terms): (Hint: consensus term add eliminate) DB- DCA (BCEAO (b)Reduce to a minimum sum of products (3 terms consensus theorem) (AB) (A+B)(CGD) (C) Reduce to a minimum product of sums (4 terms consensus theorem) (A+B+C)(A+B +E)(A+E+D)(A+B+D) (A +C) 3- Eliminate the exclusive-OR, and then factor to obtain a minimum product of sums: (a) AB +(AG CDD 1- In each case, multiply out to obtain a sum of products: Simplify where possible) (b) (A+B+C)(A+D'+C)(C'+A'+D)(B'+A)(D'+A) 2- (a) Reduce to a minimum sum of products (4 terms): (Hint: consensus term add eliminate) DB- DCA (BCEAO (b)Reduce to a minimum sum of products (3 terms consensus theorem) (AB) (A+B)(CGD) (C) Reduce to a minimum product of sums (4 terms consensus theorem) (A+B+C)(A+B +E)(A+E+D)(A+B+D) (A +C) 3- Eliminate the exclusive-OR, and then factor to obtain a minimum product of sums: (a) AB +(AG CDD