Let s be a scalar. Consider the linear programs (P) max 2.01 - 22 s.t. 28.01 + x2 0,12 > 0. 1. Set problem (Ps) in standard form. 2. List all bases for this problem (there are 6 of them.) For each, compute the associated basic solution. For each one of these basic solutions, give conditions on s (if any) for which it is feasible. 3. For s > 0, argue that the feasible region does not have rays. Then, by examining basic feasible solutions, identify an optimal extreme point for all values of s. 4. Find one value of s for which (Ps) is unbounded. Let s be a scalar. Consider the linear programs (P) max 2.01 - 22 s.t. 28.01 + x2 0,12 > 0. 1. Set problem (Ps) in standard form. 2. List all bases for this problem (there are 6 of them.) For each, compute the associated basic solution. For each one of these basic solutions, give conditions on s (if any) for which it is feasible. 3. For s > 0, argue that the feasible region does not have rays. Then, by examining basic feasible solutions, identify an optimal extreme point for all values of s. 4. Find one value of s for which (Ps) is unbounded