Assignment Problem A contractor is assembling a crew with six positions. The contractor will select the six people from among a dozen of rm's employees who are willing to travel. Each of the dozen people who are eligible for the assignment has been ranked according to eectiveness in each of the six slots. The selection problem is to choose the ix crew members from the 12 eligible employees in such a way that the crew's total eectiveness is maximized. You are given the eectiveness eij of the ith eligible employee in the jth position on the crew, in all 72 parameters. The decision variables are xij = 1 of eligible employee i is chosen for the jth job on the crew, and 0 otherwise. Formulate this problem as an LP (continuous variables) and solve via CPLEX (Arbitrarily generate eij ).