Consider the Boolean function of three variables

$F(A,B,C)={\displaystyle \underset{?}{\overset{?}{}}}m(3,4,5,6,7)$

a$)$ Construct a truth table for this function.

b$)$ Show the function on a Karnaugh map $($a$.$k$.$a$.$ K$-$map$).$

c$)$ Minimize the function using the Karnaugh map from part $($b$).$

d$)$ Sketch a logic gate circuit that will implement the minimized function from

part $($c$).$ Additionally, how many devices $($i$.$e$.,$ transistors$)$ will this circuit

require if implemented in CMOS technology? $($For this part, only use AND

and OR gates, instead of NAND and NOR gates$).$

e$)$ Can this function be implemented with fewer devices $($i$.$e$.,$ transistors$)?$ If so$,$

sketch the most economical gate$-$level circuit. Additionally, specify how

many devices $($i$.$e$.,$ transistors$)$ it will need. Compare this device count result

of part $($e$)$ to your device count result of part $($d$).$ Discuss.

Box your numerical results so that they are easy for me to find.

Show your work.