a) (15 points) Define your decision variables and formulate an IP that will find the shortest path from 1 to 6. b) (15 points) Solve the problem using the algorithm given in class and report the shortest path from 1 to all the other nodes. Question 2: (20 pts) A firm has 5 workers and 6 workstations and the managers want to assign the workers to workstations to minimize cost. The extra workstation will be operated by a part-time worker. The cost of the part-time worker is fixed and does not affect the decision. The cost of assigning each employee to each workstation is given in the following table: Machine Employee A 9 14. D 7 13 11 14 9 5 2 3 4 5 6 16 3 15 14 20 17 16 10 1 E 14 18 7 4 15 9 9 1 18 12 8 Because of skills of workers, worker 2 cannot be assigned to machine B, and worker 4 has to be assigned to machine D. Formulate a linear programming model to solve this problem. Define your decision variables properly. 1/3 3/3