Consider the following problem max s.t. f(x) = fi(11,12) + C282 3.01 + 01202 > 60 201 + 02212 > 60 21 > 0, 22 > 0 where I represents the level of activity 1 and 12 represents the level of activity 2. The function fi(21,22) and the values of C2, Q12, and 222 may have various possible values. (d) If f1(11, 12) = -x{+2x a, and all the constraints are omitted. Using the steepest descent method to solve the unconstrained optimization problem from the starting point (0,1). Do three iterations for the steepest descent method; Using the Newton method to solve the unconstrained optimization problem from the starting point (0,1). Consider the following problem max s.t. f(x) = fi(11,12) + C282 3.01 + 01202 > 60 201 + 02212 > 60 21 > 0, 22 > 0 where I represents the level of activity 1 and 12 represents the level of activity 2. The function fi(21,22) and the values of C2, Q12, and 222 may have various possible values. (d) If f1(11, 12) = -x{+2x a, and all the constraints are omitted. Using the steepest descent method to solve the unconstrained optimization problem from the starting point (0,1). Do three iterations for the steepest descent method; Using the Newton method to solve the unconstrained optimization problem from the starting point (0,1)