please provide correct answers fast will thumbs up

D Question 15 2 pts 15. In the Simplex Method of solving linear programming problem with minimization as objective, the optimum solution is reached at the iteration where: 0 all the elements in the pivot column are positive all the elements in the pivot column are negative all the 2-row values are non-negative all the 2-row values are non-positive D Question 16 2 pts 16-20 The table below is the Simplex tableau in a maximization LP problem. Consider the first iteration z X1 X2 51 S2 53 Solution 2 Z 1 - 3 - 2 0 0 0 $ 10 2 1 1 0 0 18 S2 0 2 2 3 0 1 0 42 S3 0 3 1 0 0 1 24 16. What is the z-value of the pivot column? 0 1 0-2 o 0 U Question 17 2 pts 17. What is the ratio corresponding to the pivot row? 21 8 0 9 D Question 18 2 pts 18. What is the pivot element? 0 1 2 2 3 Question 19 2 pts 19. What is the leaving variable? S1 OX1 53 X2 Question 20 2 pts 20. What is the entering variable? OX1 S2 X2 O 51