1. Design a digital circuit that will count the number of votes from three voters: A, B, and C. Think of each voter as responding to a question and voting yes (1) or no (0). The output of the circuit will be a 2-bit binary number, V = [V1, VO], having a value equal to the number of "yes" votes as given by the following table (12 points): # of yes votes V1 Vo 0 0 0 1 0 1 2 1 0 3 1 1 a. Make a truth table with inputs A, B, and C and outputs V1 and VO. Note that the truth table will have 8 rows because 2n = 23 = 8. b. Find the Sum of Minterms expression (a canonical form) for both outputs, V1 and VO. c. Use K-maps to reduce the logic equations from part (b) into new expressions that contain the least amount of product terms. d. Draw a logic diagram for the designs in part (c). Make sure you include all inputs and outputs.