Using linear programming/operations research, show your work. Define any decision variables with their units and bounds, and any objective functions and constraints.

a)

Five employees are available to perform four tasks. The cost, in dollars, for each employee to perform each task is given in the following table. The goal is to assign employees to tasks so as to minimize the total cost required to perform the four tasks. Because of union rules, each employee can do only one task. Employee Task 1 Task 2 Task 3 Task 4 A 12 17 12 17 B 12 8 20 16 C 13 10 13 19 D 6 12 15 18 E 17 13 9 13 Solve using the Branch and Bound Algorithm. State the details of your formulation.A. renovation company in Arkansas needs to hire a numbero'i new workers. Each candidate has a number of skills and an hourly wage that is mandated by union rules based on their skills. The company needs to have at least one worker with each skill. Due to management preferences at most two candidates from the set {B,C,D} can be used. The table below gives the hourly wage for each candidate, and shows their skills by an I. Which candidates should be hired so that all of the required skills are covered at the least expensive total hourly wage rate? Solve by computer to the optimum solution [if using LINDD, note that INT indicates a binary variable}