Computer Architecture & Computer Science

2. Given the Boolean function:

F(a, b, c, d) = m(1, 3, 5, 7, 9, 15); d(4, 6, 12, 13)

a. Write the truth table for F.

b. Implement a logic circuit for F using 2-input logic gates.

c. Simplify the SOP Boolean expression for F, using Boolean algebra.

d. Write the truth table for simplified expression for F.

e. Implement the simplified SOP expression using 2-input NAND gates.

f. Convert the NAND gate implementation in (e) into 2-input NOR-gate implementation.