Problem $1-8$ pts

a$.(2$ pts$)$ Write the logic expression of $f(A,B,C)$ directly from the diagram. Do not simplify.

b$.(2$ pts$)$ Fill the truth table for $f.$

c$.(2$ pts$)$ Use the smallest$-$size decoder and one multi$-$input OR gate to implement $f.$ Use the space below.

$\backslash$table$[[$A B C$,1],[000,],[001,],[010,],[011,],[100,],[101,],[110,],[111,]]$

d$.(2$ pts$)$ Use as few $4-$to$-1$ multiplexers as possible to implement $f.$