. . Question: Please note that this problem has three parts (a, b, and c). You may need to scroll the screen down, navigate left and right to see the whole problem. Clearly label your parts when answering. You are allowed a Minimum of 1 File, Maximum of 3 Files for this problem. Must use a pen to answer. AKNA Engineering Company (AEC) produces meat cutter machines in its two plants and ships them to three distribution centers. The distribution centers (DCs) ship them to three large retailers. Plant-1 can produce up to 1800 meat cutter machines, and Plant 2 can produce up to 2200 meat cutter machines per year. Retailers represented as R1, R2, R3, and R4, have annual demands of 800, 900, 1400, and 900 meat cutter machines, respectively. Below are the unit transportation costs from plants to DCs and DCs to retailers. Distribution Centers DC-1 DC-2 DC-3 2 6 4 5 3 2 Plant-1 Plant-2 DC-1 DC-2 DC-3 R1 2 3 5 Retailers R2 R3 3 4 4 5 2 6 R4 3 2 4 The decision variables are as follows: Xi = denote the number of units shipped from node i to node j. a. Draw a network representation for this problem. b. Formulate this problem as a linear programming model to minimize the annual transportation cost. Use above defined variables. C. Now suppose due to road construction AEC cannot use the route from DC-3 to R2. Write constraint to implement this restriction