KNAPSACK (DYNAMIC PROGRAMMING) 1. The sales manager for a publisher of college textbook has six travelling salesperson 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 not she wants to determine how many sales people 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 salesperson. 19:37/ 20:16 CC 00 8