Problem:
Question 1- Derive the sum-of-minterms and the product-of-maxterms canonical forms for the Boolean function, G(a, b, c) = c'a' + b'a + cb.
Question 2- Draw both the NAND and NOR implementations of the following functions:
Part 1- F(x, y, z)= x'y' + xz' + yz
Part 2- G(x, y, z) = (x' + y)(x + z)(y' + z)
Show the pedigree and your calculation.