Suppose we have created a simplex tableau for a linear program (assuming it is a maximization problem) that looks like the following: Row Z x1 x2 x3 X4 x5 X6 rhs 0 1 -20 0 80 0 240 0 0 O O 1 0 1 1 0 0 3 2 0 -1 0 0 1 0 1 1 3 0 0 1 0 1 O 0 3 4 0 1 0 0 1 1 2 0 2 Upload a single file that contains your handwritten answers to the following questions (a) Based on the current tableau, write down the basic variables and their corresponding values. (2 points) (b) The current tableau is clearly not optimal. To proceed to the next step, which variable will be chosen as the entering variable and which variable will be chosen as the leaving variable? (2 pointe Page 1 (c) Write down the tableau that results from performing one simplex pivot/iteration based on your choice in part (b). (You may show step-by-step work for partial credit if your final optimal tableau is incorrect, 8 points) (d) is the solution indicated by your simplex tableau in part (c) optimal? If so, write down the optimal solution and the optimal objective value. If not, identify the next entering variable and leaving variable. (2 points) 2M