Problem $1.$ USE Excel Problem solver

$(1$ point$)$ Solve the linear program below using graphical methods $($either the extreme point or iso$-$profit line methods$).$ When entering your answers, specify the as a "point", i$.$e$.$ enter

coordinates X and Y as $).$ When entering a range $($i$.$e$.$ range of optimality or range of feasibility$)$:

Use square brackets when the endpoint is included $($all values except infinity$)$

Use parenthesis when the endpoint is "not$*$ included.

Use $-$inf and inf to represent values of minus infinity and infinity respectively.

For example, if the lower endpoint is $5$ and the upper endpoint is $7\mathrm{.}25,$ you would enter $[5,7\mathrm{.}25].$ If the lower endpoint is minus infinity and the upper endpoint is $1\mathrm{.}65,$ you would enter $(-$inf, $1\mathrm{.}65].$

If the linear program cannot be solved, specify one of the following for the optimal value and specify $0$ for all other answers:

$1-$ Solution is suboptimal

$2-$ Empty feasible region

$3-$ Unbounded feasible region

$4-$ All other reasons

Enter all values to two decimal places.

max$8\mathrm{.}38Z_1+2\mathrm{.}5Z_2$

$s.t.$

$26\mathrm{.}73Z_1+27\mathrm{.}18Z_2=27$

$10\mathrm{.}71Z_1+8\mathrm{.}62Z_{2}162$

$5\mathrm{.}4Z_1+12\mathrm{.}84Z_{2}178$

$19\mathrm{.}8Z_1+6\mathrm{.}99Z_{2}127$

$Z_1,Z_{2}0$

Optimal value:

Optimal solution:

Range of optimality for $Z_2$ :

Shadow price for constraint $1$ :

Range of feasibility for constraint $1$ :

id: $6560$