Once upon a time, there was a captain of a merchant ship who wanted to reward three crew members for their valiant effort in saving the ship's cargo during an unexpected storm in the high seas. The captain put aside a certain sum of money in the purser's ofce and instructed the rst ofcer to distribute it equally among the three mariners after the ship had reached shore. One night, one of the sailors, unbeknown to the others, went to the purser's ofce and decided to claim (an equitable) one-third of the money in advance. After he had divided the money into three equal shares, an extra coin remained, which the mariner decided to keep (in addition to one-third of the money).The next night, the second mariner got the same idea and, repeating the same three-way division with what was left, ended up keeping an extra coin as well.The third night, the third mariner also took a third of what was left, plus an extra coin that could not be divided. When the ship reached shore, the rst officer divided what was left of the money equally among the three mariners, again to be left with an extra coin.To simplify things, the first officer put the extra coin aside and gave the three mariners their allotted equal shares How much money was in the safe to start with? Formulate the problem as an ILP, and nd the solution. (Him:The problem has a countably infinite number of integer solutions. For convenience, assume that we are interested in determining the smallest sum of money that satises the problem conditions. Then, boosting the resulting sum by 1, add it as a loner bound and obtain the next smallest sum. Continuing in this manner, a general solution pattern will emerge.)