A Boolean function f(a,b,c,d) is given as f(a,b,c,d)=g(a,b,c,d)+d(a,b,c,d). g(a,b,c,d)=(2,7,9,13)g(a,b,c,d)=(2,7,9,13) with dont care conditions: d(a,b,c,d)=(3,6,11,15)d(a,b,c,d)=(3,6,11,15)

a-) Simplify the Boolean function in Sum of Products.

b-) Implement the sum of products with Basic logic gates, draw the circuit diagram.

c-) Implement the sum of products with NAND gates only, draw the circuit diagram.

d-) Implement the sum of products with NOR gates only, draw the circuit diagram.

e-) Consider these three implementations and fill in the table given below. Consider propagation delay of each gate is 10ns.

Basic Logic Gates NAND Gates NOR Gates Number of Logic Gates Number of Integrated Circuits Propagation Delay