Digital Logic Circuit Question #1 (2 marks: Given the Boolean function: F(A, B, C, D) = 1) Drive the simplified Boolean function in sum-of-products form by means of a four-variable Karnaugh map. 2) Draw the logic diagram with a. [1 mark] AND, OR and NOT gates; = m(0,1,3,6,7,8,9,11,14,15 ) b. [1 mark] NAND and NOT gates [Notice that X= (X.X). Therefore, you can avoid using NOT if you want by passing the value to be inverted to both inputs of a NAND gate)