Consider the following LP problem.

Minimize z $=9\mathrm{.}10$x$1+5\mathrm{.}90$x$2,$

Subject to

Constraint $1$: $5$x$1+3$x$2>=30,$

Constraint $2$: $2$x$1+5$x$2>=33,$

Constraint $3$: x$1,$x$2>=0,$

where x$1$ and x$2$ represent the c$.$ Report the shadow price and range of feasibility of each binding

constraint.

Note: If the answer to constraints is "Binding" enter "Shadow price"

and "Range of feasibility" to $2$ decimal places or leave cells blank.d$.$ What is the range of optimality for the two objective function coefficients?

Note: Round your answers to $1$ decimal place.c$.$ Report the shadow price and range of feasibility of each binding

constraint.

Note: If the answer to constraints is "Binding" enter "Shadow price"

and "Range of feasibility" to $2$ decimal places or leave cells blank.c$.$ Report the shadow price and range of feasibility of each binding constraint.

Note: If the answer to constraints is "Binding" enter "Shadow price" and "Range of feasibility" to $2$ decimal places or leave cells

blank.

d$.$ What is the range of optimality for the two objective function coefficients?

Note: Round your answers to $1$ decimal place.