The optimal solution of this linear programming problem is at the intersection of constraints $1($c$)$ and $2($c$).$Maz $2$zi $+2$s$.$t$\mathrm{.}4$z$1+$ lt$2<mtext\; id="EditorElement\_4967111"></mtext><mn\; id="EditorElement\_4967112">4</mn><mn\; id="EditorElement\_4967113">0</mn><mn\; id="EditorElement\_4967114">0</mn><mn\; id="EditorElement\_4967115">4</mn>$z$1+3$T$,<mtext\; id="EditorElement\_4967126"></mtext><mn\; id="EditorElement\_4967127">6</mn><mn\; id="EditorElement\_4967128">0</mn><mn\; id="EditorElement\_4967129">0</mn>$lz $+2$r$2<mn\; id="EditorElement\_4967139">3</mn><mn\; id="EditorElement\_4967140">0</mn><mn\; id="EditorElement\_4967141">0</mn>$Over what range can the cocfficient of T$,$ vary before the current solution is no longer optimal?O $2\mathrm{.}5$ c$2<mn\; id="EditorElement\_4967250">6</mn>$O $0\mathrm{.}5$ c$<mtext\; id="EditorElement\_4967261"></mtext><mn\; id="EditorElement\_4967262">1</mn><mn\; id="EditorElement\_4967263">.</mn><mn\; id="EditorElement\_4967264">5</mn>$O $1\mathrm{.}33$ cC $4$O Nonc of these