Simplify the following Boolean expressions completely into an expression of reduced sum of products (not disjunctive normal form; DNF implies every variable must appear in every product, that is not the case here). For each simplification step, explain which Boolean law is applied to achieve that step. For full marks, do not apply multiple laws per step without explicitly stating all laws. (a) xyz +zy + (Fz+y)z (b) Tyz + xyz + xyz +y + xyz + Fyz. (c) Give a Boolean circuit, using only AND, OR, and NOT gates, implementing the simplified expression from part (b).