Please include a screenshot of your matlab code and output. Thank you!

A small airline, Ivy Air, flies between three cities: Ithaca, Newark, and Boston. They offer several

flights but, for this problem, let us focus on the Friday afternoon flight that departs from Ithaca,

stops in Newark, and continues to Boston. There are three types of passengers:

Those traveling from Ithaca to Newark.

Those traveling from Newark to Boston.

Those traveling from Ithaca to Boston.

The aircraft is a small commuter plane that seats $30$ passengers. The airline offers three fare classes:

Y class: full coach.

B class: nonrefundable.

M class: nonrefundable, $3-$week advanced purchase.

Ticket prices, which are largely determined by external influences $($i$.$e$.,$ competitors$),$ have been set

and advertised as follows:

$\left[\begin{array}{cccc}?& \text{I}\text{t}\text{h}\text{a}\text{c}\text{a}-\text{N}\text{e}\text{w}\text{a}\text{r}\text{k}& \text{N}\text{e}\text{w}\text{a}\text{r}\text{k}-\text{B}\text{o}\text{s}\text{t}\text{o}\text{n}& \text{I}\text{t}\text{h}\text{a}\text{c}\text{a}-\text{B}\text{o}\text{s}\text{t}\text{o}\text{n}\\ Y& 300& 160& 360\\ B& 220& 130& 280\\ M& 100& 80& 140\end{array}\right]$

Based on past experience, demand forecasters at Ivy Air have determined the following upper

bounds on the number of potential customers in each of the nine possible origin$-$destination$/$fare$-$

class combinations:

$\left[\begin{array}{cccc}?& \text{I}\text{t}\text{h}\text{a}\text{c}\text{a}-\text{N}\text{e}\text{w}\text{a}\text{r}\text{k}& \text{N}\text{e}\text{w}\text{a}\text{r}\text{k}-\text{B}\text{o}\text{s}\text{t}\text{o}\text{n}& \text{I}\text{t}\text{h}\text{a}\text{c}\text{a}-\text{B}\text{o}\text{s}\text{t}\text{o}\text{n}\\ Y& 4& 8& 3\\ B& 8& 13& 10\\ M& 22& 20& 18\end{array}\right]$

The goal is to decide how many tickets from each of the nine origin$/$destination$/$fare$-$class com$-$

binations to sell. The constraints are that the plane cannot be overbooked on either of the two legs of the ight and that the number of tickets made available cannot exceed the forecasted maximum

demand. The objective is to maximize the revenue. Formulate this problem as a linear programming

problem, and solve it in matlab.