Let the linear optimization model: Maximize 6x1 + 4x2 Subject to x1 + 2x2 <= 12 (resource A) 3x1 + 2x2<=24 (resource B) x1, x2>=0 i) Graph constraints and find feasible region. ii) Sketch isoquant representing the value of 12. Find improving direction and slide isoquant to find optimal corner point solution to problem on the graph. iii) Determine both corner points which are optimal. iv) Explain set of optimal solutions. v) Report value of optimal solution.