Question 1029073
The feasibility region is an unbounded region with the following corner points:

(0,0), (1, 19), and (0,1).

By the fundamental theorem of linear programming, the max and min are among these corner points.

At (0,0), f = 0-2*0 = 0
At (1, 19), f = 1 - 2*-19 = -37
At  (0,1), f = 0 - 2*1 = -2

Therefore the maximum value is 0 and the minimum value is -37.