Consider the following linear programming problem: Max

$$

$=$

$1$

$6$

$$

$1$

$+$

$1$

$3$

$$

$2$

$$

$.$

$$

$.$

$2$

$0$

$$

$1$

$+$

$1$

$0$

$$

$2$

$<=$

$6$

$0$

$($

$$

$$

$$

$$

$$

$$

$$

$$

$$

$$

$$

$)$

$,$

$$

$1$

$+$

$2$

$$

$2$

$<=$

$6$

$($

$$

$$

$$

$$

$$

$$

$$

$$

$$

$$

$$

$$

$)$

$,$

$$

$1$

$,$

$$

$2$

$>=$

$0$

$.$

$$The constraint lines and optimal solution are illustrated in the following figure: What is the lower bound of the

$$

$2$

$$coefficient

$($

$$

$2$

$)$

$$in the objective function, that doesn't change the optimal solution?

$($

Round to one decimal place.

$)$