The shaded region shown in the graph above (with boundaries included) represents the feasible region for a linear programming problem.
The maximum value of the objective function `y - 2x + 20`, for this feasible region, is
A. 18
B. 23
C. 25
D. 27
E. 33