Suppose there are a set of n precincts P1 . . . Pn with m voters in each precinct. Each voter supportsone of two possible political parties. (In this country, only 2 political parties exist).We are required to carve the precincts into two electoral districts which each have exactly n/2 precincts.We know exactly how many voters in each precinct support each party. The goal is to strategicallyassign the precincts to the two districts.Describe an algorithm which determines whether it is possible to define the two districts insuch a way that the same political party holds the majority in both districts. Assume n is even.Example: Consider n = 4, with the voters distributed as in the table.In this case. By grouping precincts 1 and 3 into a district and precincts 2 and 4 into a district, theRepulsive party will have a majority in both districts. Though, by total count, the Repulsive party onlyhas a tiny advantage over the Demonic party (205 to 195). Precinct134.Repulsive party 52Demonic party 4878492422 51 76Fair and Balanced Districting.Carving up electoral districts is an art! You can carefully craft electoral districts to favor your preferredpolitical party! This can mean the difference between winning and losing elections! It also allows youto marginalize voters! This is super useful to some people!Let's consider a simplified version of the problem.Suppose there are a set of n precincts P,..P, with m voters in each precinct. Each voter supportsone of two possible political parties.(In this fictitious country, only 2 political parties are allowed to exist, according to tradition).We are required to carve the precincts into two electoral districts which each have exactly n/2 precincts.We know exactly how many voters in each precinct support each party. The goal is to strategicallyassign the precincts to the two districts.Describe an algorithm which determines whether it is possible to define the two districts insuch a way that the same political party holds the majority in both districts. Assume n is even.Example: Consider n = 4, with the voters distributed as in the table.In this case. By grouping precincts 1 and 3 into a district and precincts 2 and 4 into a district, theRepulsive party will have a majority in both districts. Though, by total count, the Repulsive party onlyhas a tiny advantage over the Demonic party (205 to 195).

I have answer thi question in step 2.

Answered: Suppose there are a set of n precincts…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

Suppose there are a set of n precincts P1 . . . Pn with m voters in each precinct. Each voter supports
one of two possible political parties. (In this country, only 2 political parties exist).
We are required to carve the precincts into two electoral districts which each have exactly n/2 precincts.
We know exactly how many voters in each precinct support each party. The goal is to strategically
assign the precincts to the two districts.
Describe an algorithm which determines whether it is possible to define the two districts in
such a way that the same political party holds the majority in both districts. Assume n is even.
Example: Consider n = 4, with the voters distributed as in the table.
In this case. By grouping precincts 1 and 3 into a district and precincts 2 and 4 into a district, the
Repulsive party will have a majority in both districts. Though, by total count, the Repulsive party only
has a tiny advantage over the Demonic party (205 to 195).