1. Below is a balanced transportation table for a minimization problem. a) Show that the solution found by the minimum cost algorithm is not the optimal solution and solve the problem starting from there. b) In which ranges can the objective function coefficients (c11,c31) of x11,x31 be changed together so that the solution in A remains the same? c) The supply of the first supply point has been changed to s1=150+ and the demand for the 4th demand point changed to d4=180+. For which values of does the solution remain optimal? What happens if =60 ? What is the new solution? 1. Below is a balanced transportation table for a minimization problem. a) Show that the solution found by the minimum cost algorithm is not the optimal solution and solve the problem starting from there. b) In which ranges can the objective function coefficients (c11,c31) of x11,x31 be changed together so that the solution in A remains the same? c) The supply of the first supply point has been changed to s1=150+ and the demand for the 4th demand point changed to d4=180+. For which values of does the solution remain optimal? What happens if =60 ? What is the new solution