(4pts) Suppose you are using the modified simplex algorithm to optimize a quadratic programming problem. At some point in the algorithm, your simplex system looks like this (where the variables follow the naming conventions we used in class): 100000012431103311000010404101005010Zx1x2u1y1y2v1z1z2=??101520 (a) Which variables are in the current basis? (b) What should be the value of Z (replacing the ?? on the right-hand side) at the current basic solution? (c) Which of the non-basic variables are eligible to enter the basis in the next iteration? (d) Of the eligible non-basic variables you identified in part (c), choose one to enter the basis. Given that selection, which variable will need to leave the basis