State Boolean laws.Elucidate how they are used to simplify Boolean expressions with suitable example,

Explanation

Laws of Boolean Algebra: The NOT, OR and AND operations are `overlineA`, A+B, A. B are the Boolean operations. The results of these operations can be summarised as:
Complement law

The Boolean operations obey the following laws.
Commutative laws
A+B=B+A
A.B=B.A Associative laws
A+(B+C)=(A+B)+C
  A.(B.C)=(AB).C
Distributive laws
A(B+C)=AB+AC
A+BC=(A+B)(A+C)
The above laws are used to simplify complicated expressions and to simplify the logic circuitry.