Helpp

The sales manager for a publisher of college textbooks has six traveling salespeople to assign to three different regions of the country. She has decided that each region should be assigned at least one salesperson and that each individual salesperson should be restricted to one of the regions, but now she wants to determine how many salespeople should be assigned to the respective regions in order to maximize sales. The following table gives the estimated increase in sales (in appropriate units) in each region if it were allocated various numbers of salespeople: Region Salespersons 2 1 24 32 40 1 46 47 54 2 63 70 78 78 84 99 4 Construct a network diagram and use dynamic programming to solve this problem by constructing the usual tables for n= 3, n = 2, and n = 1. The sales manager for a publisher of college textbooks has six traveling salespeople to assign to three different regions of the country. She has decided that each region should be assigned at least one salesperson and that each individual salesperson should be restricted to one of the regions, but now she wants to determine how many salespeople should be assigned to the respective regions in order to maximize sales. The following table gives the estimated increase in sales (in appropriate units) in each region if it were allocated various numbers of salespeople: Region Salespersons 2 1 24 32 40 1 46 47 54 2 63 70 78 78 84 99 4 Construct a network diagram and use dynamic programming to solve this problem by constructing the usual tables for n= 3, n = 2, and n = 1