Consider the following LP problem:Maximize $41+22+33$Subject to: $0\mathrm{.}11+0\mathrm{.}252400\mathrm{.}221+0\mathrm{.}32+0\mathrm{.}431001,2,30($a$)$ Solve the problem using the simplex algorithm and list the binding and non$-$bindingconstraints with reasoning$($b$)$ Calculate the revised values of decision variables and objective function if the right$-$handside of the first constraint is reduced by $10$ units and the second constraint is increasedby $10$ units.$($c$)$ Calculate the revised values of decision variables and objective function if the right$-$handside of the second constraint is decreased by $50$ units