Pls use Cplex to solve this problem. . My team will like this answer for you Problem 3: 3: Company OR I receives 5 jobs: J1, J2, 33, 34 and 35. The data for each job are given as follows: JOB INCOME Skill A Skill B Skill C JI 20 5 3 3 J2 24 4 4 5 2 J3 15 3 3 3 J4 30 4 4 6 J5 35 3 3 8 For example, the job Jl gives the income of 20 and requires 5 people to work in the field A, 3 in field B, and 3 in field C. One people can only work in one field. The company has 5 types of labors with the information given as follows: Deterministic Models in Operations Research Labor Available Unit cost Skill A Skill B Skill Type 1 8 2 Type 2 9 1.5 Type 3 10 3 Type 4 13 1.7 Type 5 14 1 For Type 1, the labors can work in either field A or field B and the unit cost for using type 1 labor is 2/labor. The objective function is to maximize the profit. Assume that all jobs have the same starting time and finishing time and the company can discard some jobs if they do not have enough labors. Formulate and solve a programming model for this problem. (Hint: Let Zi be the binary variable. Zi =1 if job Ji is adopted; otherwise, Zi=0 Let Xijk be the number of labor type j with using ability k in the job I)