3. Network models by LP. (15 points modeling+5 points question) DuckCo produces canned food. It has 3 processing plants that can be used to satisfy the demand of 4 cities. Plant A can produce up to 335 thousand cans per day, plant B can produce up to 270 thousand cans per day, and plant C can produce up to 600 thousand cans per day. City 1 requires 222 thousand cans per day, city 2 requires 355 thousand cans per day, city 3 requires 100 thousand cans per day, and city 4 requires 528 thousand cans per day. The costs of processing and sending thousand cans from a plant to a city are given in Table 1. The management team wants to minimize the shipping cost. City 1 2 3 4 Plant A $5 $7 $2 $8 B $2 $5 $3 $7 $5 $3 $7 $5 Table 1. Cost of shipping a thousand cans of canned food. 3.1) Following the 5 steps introduced in class, model the above problem as an LP. Do not solve. 3.2) (Please answer after modeling the problem) What can you say about the problem if city 4 requires 600 thousand cans per day instead of 528 thousand