Problem &- 21 (Algorithuic)\ Hound ree Maner is a hotel that erevides two trpes of rooms with three rental dasses. Super Saver, Deluxe, and Business, The urofit ver nipht for each type of reom and rental class is as follows:\ \\\\table[[Rental Class],[Room,,Super Saver,Deluxe,Business],[Type I,

$30

,

$35

,-],[Type II,

$20

,

$30

,

$40

Troblem \&-21 (Algorithaic) Hound Thee Manor is a hotel that brevides two thpes of rooms with three rental dasses: Super Saver, Deluxe, and Business, The ofolit per night for each type of room and rental class is as follows: Type I reons do not have wireless ingertet access and are not available for the Eusiness rental dass. Round Tree's management makes a forecast of the demand by rental dass for each night in the future. A linear programming model developod to maximize profit is used to determine how many reservations to accept for each rental class. The demand forecast for a particular righe is 130 rentals in the Super Saver class, 60 fentals in the Deluse class, and 50 rentals in the Business dass, Round Tree has 100 Typ+ 1 rooms ard 120 Type rooms. a. Use linear programming to determine how many reservations $0 accept in each cental dass and how the reservations should be alboled to room tyeas. Is the demand by amy cental class not satisfied