Use the laws of Boolean algebra to convert each expression to DNF. Label each step with the name of the law that is used to justify that step. Your final expression should not contain terms that include a variable and its negation (such as sys). You should also remove repeated literals in the same term. For example, ayx is equivalent to xy. ___
(a) xy + x +y
___
(b) xy(x + y)

(c) x + y + z
__ _ _
(d) (x + yz)(x+y+z)

(e) (xy+z) (x + z)