Given the logic function F(A,B,C,D)=m(1,2,3,4,9,10,11,12) (a) Construct the truth table of the logic function F (b) Using the Karnaugh diagram to simplify the function F in its form sum-of-products. (c) Implement function F in its simplified form with NAND gates only, (d) Show that the Boolean function F can be constructed (implemented) by using (among other things) Exclusive-OR (XOR) logic gates (e) Obtain the product-of-sums form for F (f) Use the Karnaugh diagram to simplify F to its product-of-sums