[Solved]6 Counting Votes 15 Points Suppose B Candidates Office 2n Voters N Vote N B Write Algorith Q37189639

6. Counting Votes [15 points] Suppose A and B are candidates for office and there are 2n voters, n of whom vote for A and n for B. Write an algorithm to count the number of ways the ballots can be counted so that, at any point during the counting process, A is always ahead of or tied with B. Ballots for a given candidate are indistinguishable. For example, for 4 voters, AABB is a valid counting and ABBA is not. Input Description The input will be a sequence of test cases. The first line presents the number of test cases. The cases themselves begin with the second line. Each test case presents half the number of voters, n, where n 30 Output Description For each test case, the output should appear on a separate line. For each test case, print the number of ways the ballots can be counted so that A is always ahead of or tied with B. Sample Input Sample Output 42 Requirements a) Follow the textbook conventions to show your pseudo code. Add brief explanations of your algocidu b) Show the time complexity of your algorithm. Show transcribed image text 6. Counting Votes [15 points] Suppose A and B are candidates for office and there are 2n voters, n of whom vote for A and n for B. Write an algorithm to count the number of ways the ballots can be counted so that, at any point during the counting process, A is always ahead of or tied with B. Ballots for a given candidate are indistinguishable. For example, for 4 voters, AABB is a valid counting and ABBA is not. Input Description The input will be a sequence of test cases. The first line presents the number of test cases. The cases themselves begin with the second line. Each test case presents half the number of voters, n, where n 30 Output Description For each test case, the output should appear on a separate line. For each test case, print the number of ways the ballots can be counted so that A is always ahead of or tied with B. Sample Input Sample Output 42 Requirements a) Follow the textbook conventions to show your pseudo code. Add brief explanations of your algocidu b) Show the time complexity of your algorithm.

Expert Answer

---

Answer to 6. Counting Votes [15 points] Suppose A and B are candidates for office and there are 2n voters, n of whom vote for A an… . . .