I need an answer for this specific question please not other numbers

3. Consider the following quadratic programming problem: min -2x1 2x2 + x} + 2x 2x1x2 s.t. x1 + x2 0 a) Write down the KKT conditions. b) Suppose that this problem is to be solved by the modified simplex method. Formulate the linear programming problem (with artificial variables added if necessary) that is to be addressed explicitly. Identify the additional complementarity constraint that are enforced automatically by the algorithm. c) Perform a single iteration of the modified simplex method to the problem formulated in part (b). Write down the entering and leaving variables clearly