Assembly Logic Gates, please help

Consider the following Boolean function a) Draw the circuit for the function f using AND, OR and NOT gates b) Write the truth table for the function f. c) Express the function f in the sum of products (SOP) form. (Minimization not required) d) Express the function f in the product of sums (POS) form (Minimization not required) f (a, b, c)-ab+ a'c+ abc Consider the following Boolean function a) Draw the circuit for the function f using AND, OR and NOT gates b) Write the truth table for the function f. c) Express the function f in the sum of products (SOP) form. (Minimization not required) d) Express the function f in the product of sums (POS) form (Minimization not required) f (a, b, c, d)-(b d) (a' b' c) Find the complement of the following expressions using DeMorgan's theorems b) (z + z (v'w' + xy) c) (A' B' C D') (A C) Draw the circuit for the following Boolean function: F (x, y, z) -xy +x'y' + y'z a) using 2-level AND-OR logic b) using2-level NAND-NAND logic c) using 2-level NOR-NOR logic (hint: express the function in the product of sums form) We know that (AND, OR, NOT] is a functionally complete set. In the lectures we saw that (NAND) is a functionally complete set by showing how AND, OR and NOT can be implemented only with NAND gates. Similarly, we showed that NOR) is a functionally complete set. Using a similar strategy, a) Show that {OR, NOT is a functionally complete set b) Show that (AND, NOT] is a functionally complete set