2. Capt Ken Stark is an operations analyst for Air Force Recruiting Service {AFRS}. Over the next 6 weeks the Air Force needs to send 2,23,415 pieces of recruiting literature to high school seniors in the 15 states shown below: State LIarket'Lng Mailings AZ 8 2,331) CA. 212,95 4 CT 63,296 GA 36,552 [L 296,4? 9 LIA 99,021} IvEE 3 E ,E 4 E hill 3 6,2UT MT 3 3,309 NC 1 213,992 NJ 1.134324 NV 2 9,50 3 OH 2&0, 35 E OF. di TX 214,132 6 VA 134,1592 TOTAL MESA] 5 To coordinate with other recruiting efforts, all the mailings for a given state must go out in the same week {e.g,, if Ken decides to schedule mailings for Georgia inweek 2, then all of the 136,562 pieces of mail for Georgia must be sent that week). Ken would like to balance the work load in each week as much as possible and, in particular, he would like to minimize the maximum amount of mail to be processed in any given week during the 6week period. a. Formulate this problem as a manordering optimization problem to determine which states should be processed each week to achieve Ken's objective. Clearly dene your decision variables, objective functions, and constraints. b. Solve your maxordering optimization problem in part a. using a software package ofvour choice (e.g., Excel Solver, LINED, NIATLAE, etc.)