1) Draw the logic circuit using ANDs, ORs, and NOT gates for F = .

What is the complexity (sum of # inputs and # gates)?

2) Using Boolean Algebra simplify F= .

3) Draw the simplified logic circuit using ANDs, ORs, and NOT.

What is the complexity (sum of # inputs and # gates)?

4) Simplify the following using K-maps:

a)

b)