4.Assume all inputs are available both uncomplemented and complemented. Use NAND gate to implement the following two functions (no need to minimize):

a) (7) F = a b + b d + c d

b) (8) G = xy + y( z + xy)

5. Reduce each of the following expression to a minimum sum of products. Show each step.

a) g = w y' + w x y + w y z + w' x y + w x y' (3 terms, 6 literals)

b) f = abc + abc + abc + abc + abc + abc (3 terms, 5 literals)