In a linear programming problem, the objective function was specified as follows:Z $=2$A $+4$B $+3$C$$ GrammartyRead the following...HRMT $624-4$ CAMP...To Do Assignments..HelpSave & Exit AYSubm!$00$:$40$:$54$The optimal solution calls for A to equal $4,$ B to equal $6,$ and C to equal $3.$ It has also been determined that the coefficient associated with A can range from $1\mathrm{.}75$ to $2\mathrm{.}25$ without the optimal solution changing. This range is called A$\text{'}$s:Multiple Choicerange of feasibilitysurplus.shadow pricerange of optimalityslack.