Could you solve the question? Please solve the question in detailed as much as possible.

(Airline Crew Scheduling) Recall the airline crew scheduling problem introduced in class. The objective of the crew scheduling problem is to find a minimum cost assignment of flight crews to a given schedule. We consider a simplified version of the problem where - A flight leg is a single nonstop flight. - A pairing is a sequence of flight legs starting from a base and ending at the same base. There should be exactly one crew for each flight leg. Our goal is to find best combination of pairings to cover the whole flight schedule with minimum cost. The list of flights, their schedule and associated costs are given below. Two types of costs are incurred: fight costs and resting costs. Flight cost for each flight leg is given in the table. As for the resting cost, there is a unit resting cost of ( 220$ per min). Meaning, for every minute elapsed between the end of a previous flight and the start of the next flight, 220$ is incurred. Assume that all crews are based in Istanbul. You are asked to find the minimum cost scheduling of the airline crews that covers all the scheduled flights. Propose a formulation for this problem that is amenable to column generation. Now consider the LP relaxation of this formulation. Explicitly indicate the master problem, dual of the master problem, and the pricing