The 30 teams in the NBA are each assigned to one of 6 divisions, where each division has 5 teams. Suppose we want to assign the teams to divisions so that the average distance among teams in the...

The 30 teams in the NBA are each assigned to one of 6 divisions, where each division has 5 teams. Suppose we want to assign the teams to divisions so that the average distance among teams in the divisions is minimized. In other words, we want to make the assignments so that teams within a division are close to one another. The file P08_24.xlsx contains distances between all NBA cities. Use Evolutionary Solver to find an optimal assignment of teams to divisions. Does it turn out that your assignments to divisions are the same as the NBA’s? (Hint: Arrange the 30 teams into 6 contiguous blocks of 5 teams each. Each block will have 5 team indexes. With an alldifferent constraint, you can ensure that the 30 team indexes are all different. For each block, use lookups to find all distances between pairs of teams in that block and average these. Then average these averages over the 6 divisions to get the objective value.)