please help me answer these, an explanation would help a lot !

De Morgan's Laws De Morgan's Laws are based on the fact that: a NAND gate, (A B)', is equivalent to a NegativeOR gate, A+B; and a NOR gate, (A+B), is equivalent to a Negative-AND gate, ( AB ). This was shown by the truth tables for the individual gates in Software Lab A. De Morgan's Laws can also be proven by using a truth table based on the Boolean Expressions. Specifically, (AB)=A+B and (A+B)=AB for two or more variables. De Morgan's Laws Practice: To simplify a circuit using De Morgan's Laws means that any instance of negation applies to only one variable. For each circuit shown below: a. Write the Boolean expression for each logic circuit. b. Simplify the expression using De Morgan's laws. c. Create the simplified version of the circuit in LogicWorks. The first problem has been done for you. (ABC)+(D+E)=A+B+C+DE=A+B+C+DE