Consider the linear programming problem max cx Ax $0,$ where $1$ A $141132$ b$=$ CT $=[654354].1$ Solve this problem using the following strategy: $($a$)$ Find the dual of the above primal linear program. The dual has only two variables. Solve the dual by inspection after drawing a graph of its feasible set. $($b$)$ Using the optimal solution to the dual problem and the optimality condi$-$ tions, determine what primal constraints are binding and what primal vari$-$ ables must be zero at an optimal solution. Using this information, determine the optimal solution to the primal linear program.