Consider the following maximization LP in the dictionary format: 6 512 + 75 5 + 212 CA 215 6 + 312 - 214 + Answer the following questions by filling in the blanks below. Is the variable x1 basic? (yeso) Is the variable xz basic? (yeso) Is the variable xs basic? (yeso) Is the variable x. basic? (yeso) is the variable xs basic? (yeso] Is the variable x: basic? (yeso) The corresponding basic feasible solution is: Suppose we want to perform an iteration of the simplex method. Which variable will enter the basis next? How many rows will participate in the ratio test? Which variable will leave the basis next? What will be the new basic feasible solution after the pivot is performed? X1 X= = X4 XE