\fThe university is scheduling cleaning crews for its ten buildings. Each crew has a different cost and is qualified to clean only certain buildings. There are eight possible crews to choose from in this case. The goal is to minimize costs while making sure that each building is cleaned. The management science department formulated the following linear programming model to help with the selection process. Min 200x1 + 250x2 + 225x3 + 190x4 +215x5 + 245x6 + 235x7 + 220X8 S.t. X1 + X2 + X5 + x7 2 1 {Building A constraint] X1 + X2 + X3 2 1 {Building B constraint] X6 + X8 2 1 {Building C constraint] X1 + X4 + x7 2 1 {Building D constraint] X2 + x7 2 1 {Building E constraint] X3 + X8 2 1 {Building F constraint] X2 + X5 + x7 2 1 {Building G constraint] X1 + X4 + x6 2 1 {Building H constraint] X1 + X6 + X8 2 1 {Building | constraint] X1 + X2 + x7 2 1 {Building J constraint] 1, if crew j is selected xj = 10, otherwise Without solving the BIP model, which crew could be scheduled to clean Buildings B and F