1 Boolean Expressions Given the following truth table: 0 0 0 0 0 0 0 0 0 1 0 1 0 1 0 1 1 0 1 0 1 0 1 0 1 1 1 1 1 1 11 2 0 0 0 1 1 0 1 0 0 0 1 1 0 0 0 1 1 0 1 1 0 0 0 1 1 0 11 0 0 1 1 0 1 0 1 0 0 0 1 0 1 0 0 write an expression for f in simplest form, as a sum of minterms. You should have four minterms, each a product of three inputs. (There is more than one correct solution.) Use a Karnaugh map. What function does this implement? 1.1 Part two Change two of the zeros to ones to make a new function that can be simplified to the sum of three minterms that is each the product of two inputs