Use the simplex algorithm to solve the following linear program. If there is a unique optimalsolution, specify the optimal solution and objective value. If there are alternative optimal solutions, listthree unique optimal solutions and the optimal objective value. If the problem is unbounded, explainhow you were able to make this determination.min $212\mathrm{.}52$s$.$t$.21+1\mathrm{.}52<=62\mathrm{.}251+2<=91,2>=0$