4.1.1. Consider the following problem. Maximize Z= x + 21, subject to 52 X2 S2 X1 + x2 3 and X 20, X2 20. (a) Plot the feasible region and circle all the CPF solutions. (b) For each CPF solution, identify the pair of constraint bound- ary equations that it satisfies. (c) For each CPF solution, use this pair of constraint boundary equations to solve algebraically for the values of xy and X, at the corner point. (d) For each CPF solution, identify its adjacent CPF solutions. (e) For each pair of adjacent CPF solutions, identify the constraint boundary they share by giving its equation. 4.1.1. Consider the following problem. Maximize Z= x + 21, subject to 52 X2 S2 X1 + x2 3 and X 20, X2 20. (a) Plot the feasible region and circle all the CPF solutions. (b) For each CPF solution, identify the pair of constraint bound- ary equations that it satisfies. (c) For each CPF solution, use this pair of constraint boundary equations to solve algebraically for the values of xy and X, at the corner point. (d) For each CPF solution, identify its adjacent CPF solutions. (e) For each pair of adjacent CPF solutions, identify the constraint boundary they share by giving its equation