A set of Boolean functions forms a complete basis Ohm if a logic circuit can be constructed for every Boolean function f: B^n rightteearrow B using just functions in Ohm. a) Show that the basis consisting of one function, the NAND gate, a gate on two inputs realizing the NOT of the AND of its inputs, is complete. b) Determine whether or not the basis {AND, OR} is complete