No. 3.

Derive a Boolean expression for a voting machine which allows three persons to vote. The output is either yes or no dependent on the number of persons voting yes. Two restrictions: 1) No abstain allowed. That is each person has to vote either yes or no. 2) The outcome is yes if two or more yes votes: otherwise, the outcome is no. Normally when forming a voting group, like board of trustee, the number of voting members is designated to an odd number to avoid a tie situation. Derive a sum-of-product format first and then use Karnaugh maps to simplify the expression. An equivalent circuit for an AND gate is shown below: Draw an equivalent circuit for a NOT gate. Extend the idea from Problem 4 and draw an equivalent circuit for a NAND gate