Using linear programming, solve by computer and show your work.

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}