(14 points) The MLRC wants to assign a student worker to each afternoon tutoring slot. There are 6 students interested in this job, and each can be assigned one day at most. The MLRC director assigns desirability values for each possible assignment, based on the student's preferences and other considerations. She wants to find the assignments that will maximize the sum of these desirability values. These values are given in the following table: Desirabilities Monday Tuesday Wednesday Thursday Friday Anne Bruce Chuck Denise Evan Fran w hot win a. Find all possible optimal assignments by hand using the Hungarian algorithm, and show your work. What is the maximum total desirability? b. In an optimal solution, who does not get an assignment? c. Formulate this problem mathematically. d. Solve the problem using software (e.g., the IOR Tutorial or Lingo), and hand in a printout of the solution (14 points) The MLRC wants to assign a student worker to each afternoon tutoring slot. There are 6 students interested in this job, and each can be assigned one day at most. The MLRC director assigns desirability values for each possible assignment, based on the student's preferences and other considerations. She wants to find the assignments that will maximize the sum of these desirability values. These values are given in the following table: Desirabilities Monday Tuesday Wednesday Thursday Friday Anne Bruce Chuck Denise Evan Fran w hot win a. Find all possible optimal assignments by hand using the Hungarian algorithm, and show your work. What is the maximum total desirability? b. In an optimal solution, who does not get an assignment? c. Formulate this problem mathematically. d. Solve the problem using software (e.g., the IOR Tutorial or Lingo), and hand in a printout of the solution