Exercise 3. (Bivariate Brute Force) Solve the optimization problem max 1+x{(x2 - 1)3e-11-12 s.t. X2 > log xi X1 + x2 0 by brute force using MATLAB, trying all choices of 21 = 0,001, .002, .003, ...,6 together with all choices of 22 = 0,.001, .002, .003,...,6 that give feasible points. Give the approximate) optimal solution and the optimal objective function value. This may be done interactively in MATLAB (hand in diary) or as a MATLAB function (hand in function file and upload to Blackboard). Do not turn in printouts of all the values f(0,0), f(0, 0.001)