(algorithmic) consider the following linear program: min 2 a + 2 b s. t. a + 3 b ≤ 12 3 a + b ≥ 13 a - b = 3 a, b ≥ 0 choose the correct graph that shows the feasible region. what are the extreme points of the feasible region? there are two extreme points: and find the optimal solution. the optimal solution is a = , b =