RVW (Restored Volkswagens) buys 15 used WW's at each of two car auctions each week held at different locations. It then transports the cars to repair shops it contracts with. When they are restored to RVW's specifications, RVW sells 10 each to three different used car lots. There are various costs associated with the average purchase and transportation prices from each auction to each repair shop. Also there are transportation costs from the repair shops to the used car lots. RVW is concerned with minimizing its total cost given the costs in the table below. a. Given the costs below, draw a network representation for this problem. Repair Shops Used Car Lots S1 S2 L1 L2 L3 Auction 1 550 500 s1 250 300 500 Auction 2 600 450 52 350 650 450 b: Formulate this problem as a transshipment linear programming model. Do NOT attempt to solve the problem. Min 500X13 + 500X14 + 600x23 + 450X24 +250X35+300X36) +500X37 +350X45 + 650X46 + 450X47 ST, X13 + 4 =0 for all