1. (40 points) Use the assignment method to obtain a plan that will minimize the processing costs in the following table under these conditions: WORKER 1 2 Job 3 4 5 14 14 12 11 10 B 18 15 16 13 16 C 20 19 15 14 15 D 17 16 14 12 14 a. The combination 2-D is undesirable. All jobs must have a worker assigned and only worker C is able to handle two jobs (Use Hungarian method). b. The combinations 1-A and 2-D are undesirable. To each job exactly one worker must be assigned. All workers are able to handle two jobs (Use linear programing)