Karnaugh Mapping and Circuit Implementation 1 Complete the truth table below for a Boolean Function which is defined to be true, output in the table is 1, when all or at least two of input variables are 0. Complete the truth-table and draw a Karnaugh map for the output F. The Boolean expression should be a (sum of products) expression, but implement the circuit using all NAND gates. Draw a diagram of your circuit. 0 0 01 0 1 0 1 0 2] Complete the truth table below for a Boolean Function which is defined to be true, outnut in the table is 1 when any combination of variable inputs represents a prime