(Multilevel Logic) Consider the following multilevel Boolean expressions:
Perform the following:
(a) Show how to implement each function as a multilevel NAND-only gate-level implementation.
(b) Repeat (a), but using NOR gates only.
(c) Find the two-level minimized sum-of-products forms.
(d) Find the two-level minimized product-of-sums forms.
(e) Briefly compare the implementation complexities in terms of gates and literals. For each function, which achieves the "simplest" implementation.