Suppose three pirates of different ages have a treasure of 100 gold coins. They decide to split the coins using this scheme:

• The oldest pirate proposes how to share the coins, and ALL pirates (including the oldest) vote for or against it.
  • If more than 50% (exclusive) of the pirates vote for it, then the coins will be shared that way and the game ends. Otherwise, the pirate proposing the scheme will be thrown overboard, and the process is repeated with the pirates that remain. Note that if exactly 50% of the pirates vote for it, then the pirate proposing the scheme will be thrown overboard.
  • As pirates tend to be a bloodthirsty bunch. If a pirate would get the same number of coins if he voted for or against a proposal, he will vote against so that the pirate who proposed the plan will be thrown overboard.
• Assuming that all 3 pirates are intelligent, rational, greedy, and do not wish to die, (and are rather good at math for pirates). Assume Pirate 1 is the oldest and Pirate 3 is the youngest

Fo the next four questions, assume now Captain Hook spots the scene and wants to share the gold as well. That is, now we have four pirates sharing the coins. Captain Hook will be the first to propose a scheme to share the coins. Assume the same rule applies.

1. What is the maximum amount of gold coins that Captain Hook can get? Fill in the closest integer without comma or unit.

2. What is the maximum amount of gold coins that Pirate 1 can get? Fill in the closest integer without comma or unit.

3. What is the maximum amount of gold coins that Pirate 2 can get? Fill in the closest integer without comma or unit.

4. What is the maximum amount of gold coins that Pirate 3 can get? Fill in the closest integer without comma or unit.