Problem 2: A computer company has manufacturing plants in three locations: A, B, C, which have annual capacity of 3,000, 6,000, and 9,000 units respectively. The computers once produced at the plants are shipped directly to four retail outlets : #1, #2, #3, #4 by the company's own fleet of trucks. For the next year, retail outlets #1 and #2 have no quota limit on the company's computers, while retail outlets #3 and #4 each can take up to 2,000 computers from the company. Due to the fleet size limit, the company's fleet can deliver at most a certain number of computers from a given plant to a given retail outlet in each year as shown in the following table: #3 #4 Annual transportation capacity on each link: #1 #2 A 800 1,600 B 900 1.200 1,400 1,300 900 1,000 1,300 1,600 700 500 Furthermore, the fleet size is such that it imposes the following restrictions: (1) At most a total of 2,000 computers can be delivered from plant A to retail outlets #2 and #3. (11) At most a total of 3,000 computers can be delivered from plant C to retail outlets #1, #2, and #3. Find a shipping strategy for the company to send as many of its computers as possible to the market in the next year. Formulate the problem as a linear programming problem. Clearly define decision variables, objective function, and constraints