b) Solve the problem in part (a) using the simplex algorithm. Perform only two iterations Q 2: Furnco manufactures tables and chairs. Each table and chair must be made entire entirely out of pine. A total of 150 board ft of oak and 210 board ft of pine are available. either 17 board ft of oak or 30 board ft of pine, and a chair requires either 5 board ft of 0 of pine. Each table can be sold for $40, and each chair for $15. Formulate an LP the maximize revenue. b) Solve the problem in part (a) using the simplex algorithm. Perform only two iterations Q 2: Furnco manufactures tables and chairs. Each table and chair must be made entire entirely out of pine. A total of 150 board ft of oak and 210 board ft of pine are available. either 17 board ft of oak or 30 board ft of pine, and a chair requires either 5 board ft of 0 of pine. Each table can be sold for $40, and each chair for $15. Formulate an LP the maximize revenue