Consider a standard form linear programming problem with 0 201 A=1100 0 3 10 b=8 9 5 Suppose that we are told that the reduced cost coefficient vector corresponding to some basis is r = [0,1,0, a. Find an optimal feasible solution to the problem. b. Find c2.