$1)$ Linear programming is a model consisting of linear relationships representing a firm'sdecisions given an objective and resource constraints.A$)$ TrueB$)$ FalseC$)$ all of the aboveD$)$ neither$2)$ The objective function always consists of either maximizing or minimizing some value.A$)$ TrueB$)$ FalseC$)$ all of the aboveD$)$ neither$3)$ There is exactly one optimal solution point to a linear program.A$)$ TrueB$)$ FalseC$)$ all of the aboveD$)$ neither$4)$ The shadow price for a positive decision variable is $0.$A$)$ TrueB$)$ FalseC$)$ all of the aboveD$)$ neither$5)$ Sensitivity ranges can be computed only for the right$-$hand sides of constraints.A$)$ TrueB$)$ FalseC$)$ all of the aboveD$)$ neither