First, this is one problem (a-g) . If you do not know how to use ampl, you can use other software you know (excell) etc. Also, I need help with the process of elaborating this problem as a linear program. Then, responding to the other questions. Yes, I know it is too much but I have been stuck in this problem since 3 days ago. I didn't find similar examples, and the videos of my instructor dont cover this difficult t types of problems. Could you help me pleaseeee?

Part a (Note: It is especially important that you show your work on this problem.) The local transit company operates a number of bus routes that run each day of the week, including weekends. Each bus driver that is hired by the company will work for five days, and the work days must be consecutive. For instance, a driver may work M-T-W-Th-F or F-Sa-Su-M-T, but T-W-F-Sa-Su would not be acceptable because Thursday is skipped. The transit company needs to determine how many bus drivers to hire and which days they should work in order to minimize the total cost of labor. The transit company has determined how many drivers will be needed each day. It is acceptable to have more than the requested number of employees available each day, but not fewer. The requested drivers for each day are as follows: Drivers Requested Day Monday Tuesday Wednesday Thursday Friday Saturday Sunday Each driver earns $800/week plus an extra $80 for working on Saturday or Sunday. The extra weekend pay is per day, so a driver who works Th-F-Sa-Su-M would earn $800/wk base pay plus an additional $160/wk for two weekend days worked (for a total of $960/wk). However, a driver that only works one weekend day (e.g., a Su-M-T-W-Th schedule) would earn $880/wk. Formulate this problem as a linear program (not as an integer program). You will need seven variables. Solve using AMPL/CPLEX using the sensitivity option. You should find that even as a linear program, the optimal solution is all integer. (To check your work, the optimal objective value should be $35, 280/wk.) List the optimal solution for this problem, the shadow price and allowable range associated with each constraint right-hand-side, and the reduced cost and allowable range for each objective function coefficient. Part b We currently need 22 drivers on Thursday. By how much does the optimal objective function value increase if we need a 23rd driver scheduled for Thursday? (Justify using your answer to part a.) Part c We currently need 39 drivers on Wednesday. By how much does the optimal objective function value decrease if we need only 38 drivers scheduled for Wednesday? (Justify using your answer to part a.) Part d Suppose we need 39 drivers scheduled for Friday (instead of 30). Does the data from part a allow us to determine what happens to the optimal objective function value in this case? (Why or why not?) (Justify using your answer to part a.) Part e Suppose we need 45 drivers scheduled for Monday instead of 36). Does the data from part a allow us to determine what happens to the optimal objective function value in this case? (Why or why not?) (Justify using your answer to part a.) Part f Currently, there is only one shift (M-F) in which workers earn exactly $800/wk. Is it possible to determine what happens to the optimal solution and objective function value if the pay for this shift is changed to $900/wk? If so, determine the new optimal solution and objective function value. (Jus- tify using your answer to part a.) Part g Currently, workers on the Sa-W shift earn $960/wk. Is it possible to determine what would happen to the optimal solution if you started paying $1,500/wk for this shift? If so, determine the new optimal solution and objective function value. (Justify using your answer to part a.)