A political party wants to campaign for the forthcoming elections. The party has planned to allocate party volunteers to the four constituencies the party plans to contest in. Each volunteer visits his/her assigned constituency, meets voters, and seeks votes for their party. Sometimes volunteers can arrange a public meeting and reach out to many voters. Each volunteer can meet around 50 voters a day. Each volunteer needs R500 per day toward his or her personal and publicity material expenses. The following table lists the minimum number of voters the party plans to reach and the available campaigning period before the Election Day.

Min. voters to reach Period (days) Budget allowed in S Constituency 1 4500 10 50000 Constituency 2 9000 12 90000 Constituency 3 6500 12 72000 Constituency 4 5000 10 50000 The party wants to determine the number of volunteers required to campaign in each constituency while maximizing their reach to voters.

a. Formulate an integer programming model for this problem.

b. Solve this model by using the computer.