A small airline must schedule exactly one departure from Sabiha Gken Airport to each of four cities: Izmir, Ankara, Diyarbakr, and Antalya. The available departure times are 1 pm, 2 pm, and 3 pm. The airline has only 2 departure lounges, and so at most two flights can be scheduled during a time slot. The airline estimates the following profits per flight (in hundreds of dollars) as a function of departure time: Estimated Profits for Destinations and Departure Times b. Destination zmir Ankara formulation. 1 2 3 4 Diyarbakr Antalya Departure Times 1:00 pm 10 11 12 10 2:00 pm 9 10 10 11 Define decision variables X = 1 if flight to destination i is scheduled at time j. and 0 otherwise (i = 1,2,3,4; j = 1,2,3). Formulate the problem of maximizing profit as an integer LP by using algebraic 3:00 pm 9 10 9 11 Find a feasible solution to the problem. What is its profit? Is this an upper or a lower bound on the optimal profit value?