8. Each of the canonical linear programming problems below has infinitely many optimal solutions. Solve each of the linear programming problems by using the simplex algorithm and find all optimal solutions. [Note: In the exercises of Chapter 3 and Chapter 4, an optimal solutions of linear programming problems having infinitely many optimal solutions. For this reason, complete discussions of the problems below may be found in the answers section in the back of this book.] increasing emphasis will be made on finding all x y z W -1 1 1 1-1 | 31=-t2 1 2 2 -4 0f 8. Each of the canonical linear programming problems below has infinitely many optimal solutions. Solve each of the linear programming problems by using the simplex algorithm and find all optimal solutions. [Note: In the exercises of Chapter 3 and Chapter 4, an optimal solutions of linear programming problems having infinitely many optimal solutions. For this reason, complete discussions of the problems below may be found in the answers section in the back of this book.] increasing emphasis will be made on finding all x y z W -1 1 1 1-1 | 31=-t2 1 2 2 -4 0f