1)

For the timing diagram above a. Write f(a,b,c) as the sum of minterms (m()).(= upper case sigma ) b. Write f(a,b,c) in canonical sum of products form. c. Using Boolean Algebra simplify f(a,b,c) to find a minimum sum of products form for f(a,b,c). d. Write f(a,b,c) as the product of maxterms (M()).(= upper case pi) e. Write f(a,b,c) in canonical product of sums form. f. Using Boolean Algebra simplify f(a,b,c) to find a minimum product of sums form for f(a,b,c). g. Implement f(a,b,c) using only NAND gates (draw a logic network). h. Implement f(a,b,c) using only NOR gates (draw a logic network)