Table $10-5$

Maximize: $Z=30x1+45x2+353$

Subject $to$: $5x1+6x2+8x370$

$,2x1+1x2+3x325$

$,3x1+2x2+2x315$

all $x_i$ are integer and non$-$negative

Final Integer Solution $Z=315$

Table $10-5$ represents a solution for an integer programming problem. If one uses the

optimal solution presented, how much slack is there in the first constraint?

$28$ units

$15$ units

$30$ units

$22$ units