2. The figure shows the graphical model of a linear program. The large numbers on the right (1,2, and 3) indicate the constraints The feasible region is shown in white, and the infeasible region is shaded. The vari- ables are restricted to nonnegative values. The small numbers (0, 1, 2, and 3) indi- cate four feasible corner points: 0, 1,2,3 Three objective functions are under con- sideration, as indicated by the three lines labeled A, B, and C. The arrows represent the directions of increasing objective func- tion. Objective B is parallel to constraint 3. In each case, specify the location of the optimal solution. If there is more than one optimal solution, characterize all of them. (a) Maximize A (b) Maximize B (c) Maximize C (d) Minimize A (e) Minimize B (0) Minimize C (g) Drop x, 2 0 and minimize C