(1). Use Dynamic Programming to solve the following: An airline plans to fly 6 flights out of Islip airport daily. There are 3 destinations under consideration, and each destination will have at most 3 flights to it. The profit is given in the table below. We wish to find how many flights should be scheduled to each destination in order to maximize profit. We define fi?(s) as the maximum profit for destinations i,i+1,3 with s flights to distribute. Solve using Dynamic Programming. Make sure to clearly define the stages, the state and show your work