Redo the last exercise using the Quine–McCluskey method. Show the truth table of a function that outputs a 1 whenever the 4-bit input, treated as representing a 4-bit signed binary number, is equal to...

Redo the last exercise using the Quine–McCluskey method. Show the truth table of a function that outputs a 1 whenever the 4-bit input, treated as representing a 4-bit signed binary number, is equal to +2, +4, or +5. Derive a simplified logical expression using the Karnaugh map method. Show an implementation of this function.