Problem 1: A sales manager must decide how to allocate her four available salespersons among three districts in her territory. The sales results (in thousands of dollars per month) are shown below as a function of the number of salespeople assigned to a district. Let stage 3 = C. District/No. of Salespeople Assigned a) Use DP to find the assignment of salespersons to districts that maximizes sales. b) Without resolving the problem, find the second best assignment. c) Without resolving the problem, find the best solution if only three salespeople are available. Stage = districts A, B, C Decisions = number of salespeople to assign State = availability of salespeople BACKWARD APPROACH: Stage 3 (District C) -'-__ _'- -'-__ Stage 2 (Districts B and C) f2(525 X2) 2 max \"2(le + fallsz' X 2)} 52 x2=0 X2=1 x2=2 X223 X224 0 6 + 4 = 10 l 6+9215 10+4=l4 15 2 6+11:17 10+9:19 14+4: 18 21 6+18= 24 10+15= 14+11= 17+9= 26 15+4= 19