For function F represented in given truth table, perform tasks given below.
| x |
y |
z |
F |
| 1 |
1 |
1 |
1 |
| 1 |
1 |
0 |
0 |
| 1 |
0 |
1 |
1 |
| 1 |
0 |
0 |
0 |
| 0 |
1 |
1 |
0 |
| 0 |
1 |
0 |
1 |
| 0 |
0 |
1 |
1 |
| 0 |
0 |
0 |
1 |
i) Show function F in disjunctive normal form (sum of products expansion).
ii) Show function F in conjunctive normal form (product of sums exansion).
iii) Sketch Boolean circuit that represents function in disjunctive normal form; it must match expression you gave in (a).
iv) Utilize the Karnaugh map to misimize function.
v) Sketch minimized Boolean circuit which represents simplified function.