Given the Boolean function:

F(A,B,C) = [A`( A + B`+A`B`C`) (A + B + C) +A`BC` ]L

i- Complete the following truth table by inserting 0 or 1 for F.

A	B	C	F
0	0	0
0	0	1
0	1	0
0	1	1
1	0	0
1	0	1
1	1	0
1	1	1

ii - Draw the logic diagram of the original Boolean expression for F

iii- Which one of the following represents the simplified algebraic expression for F e- f- NONE

iv- Draw the logic diagram for the simplified expression

v- Insert the total number of 2-input gates used for the simplified and original Boolean experssions in the following table (Hint; consider the NOT gate as 2-input gate):