pls help me solve it fast especially number 3. I found 1 and 2 here. it's urgent.

A paper recycling plant process box board, tissue, paper,newsprint, and book paper in to pulp that can be used to produce three grades of recycled paper (grades 1, 2 and 3). The prices per ton and pulp contents of the four inputs are shown in below table. Two methods, doinking and asphalt dispersion, can beused to produce the four inputs into pulp. It cost $20 to de-ink a ton of any input. The process of de-inking removes 10% of the inputs pulp, leaving 90% of the original pulp. It costs $15 to apply asphalt dispersion to a ton of material. The aptal dispersion removes 20% of the input's pulp. At most 3.000 tons of inpul can be run through the asphalt dispersion process or de-inking process. Grade 1 paper can only be produced with newsprint or book paper pulp, grade 2 paper, only with book paper, tissue paper, or box bound pulp; and grade 3 paper, only with newsprint, tissue paper, or box board pulp. To meet its current demands, company needs 500 tons of pulp for grade 1 paper, 500 tons of pulp for grade 2 paper, and 600 tons of pulp for grade 3 paper. Formulate an LP to minimize the com 2 of meeting the demands for pulp. Problem 2: The IRS has determined that during each of the next twelve months they will need the number of super computers given in table below. To meet these requirements the IRS rentes upercomputers for a period of one, two, or three months. It costs $100 to rent a supercomputer for one month, $180 for two months, and $250 for three months. At the beginning of month 1 the IRS has no supercomputers. Determine the rental plan that meets the next twelve months requirements at minimum cost. Note: you may assume that fractional rentals are okay. This is your solution says rent 140.6 computers for one month you can round this up or down without having much effect on total cost. 3 1 800 2 1.000 4 500 Month Requirement 5 1.200 6 400 7 500 $ 600 9 400 10 500 300 600 Problem 3: Find the solution by using graphical method. max z = (2x - 3x| 4x, + x2 54 2x, -X, 50,5 s.t. XX, 20