Minimize the following Boolean function and draw the circuit diagram (use logic gate symbols) using only NAND gates (HINT: DeMorgan's Theorem is required here). F(a,b,c,d) = (0,2,5,7,8,10,13,15) a) Complete the correct K-map of function F(a, b,c,d). [4 marks] b) Write F(a,b,c,d) in standard form (terms must be correctly ordered in increasing value). [4 marks] Write the minimized Boolean F(a, b, c,d) function using K-map reduction techniques. [4 marks] d) Write the minimized Boolean F(a,b,c,d) function using ONLY NAND gates. Show how you verified the minimized circuit. [4 marks] e) Using logic symbols draw the minimized Boolean F(a,b,c,d) function using ONLY NAND gates. [6 marks]