Assume that you have a preferential-ranking-based voting system with n voters and 3 candidates {x, y, z}.

• Give a formula (in terms of n) that describes the number of Condorcet elections (i.e., ways in which n people can vote) in which, without editing the votes, candidate x beats every other candidate.
• Give a formula (in terms of n) that describes the number of Dodgson elections (i.e., ways in which n people can vote) that candidate x wins.