1. A textbook publishing company has developed two new sales regions and is planning to transfer some of its existing sales force into these two regions. The company has 10 sales person available for the transfer. Because of the different geographic configurations and the location of schools in each region, the average annual expenses for a salesperson differ in the two regions; the average is $10,000 per sales person in region 1 and $7,000 per salesperson in region 2. The total annual expense budget for the new region is $72,000. It is estimated that a sales person in region 1 will generate an average of $85,000 in sales each year and a salesperson in region 2 will generate $60,000 annually in sales. Solve this integer programming problem using branch and bound method. 2. In the novel Around the Worlds in 80 days by Jules Verne, Phileas T. Fogg wagered four of his fellow members of the reform club in London $5,000 apiece that he could travel around the world in 80 days. This would have been an astounding feat in 1872, the year the novel is set. Then the fastest modes of travel were rail and ships, however, much of the worid still traveled by coach, wagon, horse elephant, or donkey, or on foot. Phileas Fogg was not a frivolous man. He would not have undertaken such large wager if he had not carefully researched the feasibility of such trip and been confident of his chances. Although he undoubtedly analyzed various routes to circumvent the globe, he did not have knowledge of techniques such as the shortest route method, nor did he have computer to help him select an optimal route. If he had, he might have chosen a route that would have completed his trip in less than 80 days or possibly would not have been so quick to make a wager. On the next page is a map of the various routes of the day for travelling around the world from London. Fogg travelled eastward. The travel time, in days, is shown on each branch. Travel times are based as much on available modes of transportation at the time as on distance. Using the shortest route method select the best route for Mr.Fogg. Would the route you determined have won him his wager