Linear Programming Problem, solve using technology. A waste management company has three recycling facilities in Paramus, Newark, and Jackson that can accept plastic recyclables and produces two grades of recycled plastic pellets, Grade A and Grade B. The Paramus facility can make 20 tons of Grade A and 10 tons of Grade B per day. The Newark plant can make 10 tons of Grade A and 20 tons of Grade B per day. The Jackson plant can make 10 tons of Grade A and 30 tons of Grade B per day. The company has orders of at least 400 tons of Grade A, at least 800 of Grade B. If daily costs are $2000 at Paramus, $4000 at Newark, and $5000 at Jackson. Set up a linear programing problem to find how many days should each facility operate to fill the demand at minimum cost? Solve the LP using technology for full credit you must a. Define your variables b. Write the objective function c. Write all constraints d. Suppose you want to add the following constraint: The number of days that the Newark Facility operates is at least the same as the number of days the Paramus Facility operates. Write the constrain in a way that it could be input in to a linear Programing Solver. BIUA ALEX XE E HTML Editor x GVT 12pt P