Consider the following problem max s.t. f(x) = fi(11, 12) + C222 301 + 012.12 > 60 2.0 + 222.02 > 60 11 > 0, 02 > 0 where I represents the level of activity 1 and 22 represents the level of activity 2. The function fi(21, 12) and the values of c2, Q12, and 222 may have various possible values. (e) if f1(x1, x2) = -x + 2x1 + x, and all the functional constraints are omit- ted. Using the projected gradient method to solve the non-negativity constrained quadratic programming. Do three iterations for the steepest method. Consider the following problem max s.t. f(x) = fi(11, 12) + C222 301 + 012.12 > 60 2.0 + 222.02 > 60 11 > 0, 02 > 0 where I represents the level of activity 1 and 22 represents the level of activity 2. The function fi(21, 12) and the values of c2, Q12, and 222 may have various possible values. (e) if f1(x1, x2) = -x + 2x1 + x, and all the functional constraints are omit- ted. Using the projected gradient method to solve the non-negativity constrained quadratic programming. Do three iterations for the steepest method