The One Desk Company manufactures desks at three factories (F1, F2, F3) on the West Coast. Their products are shipped by rail to a pair of depots D1, D2), one in the Midwest and one in the South. At the depots, the products are repackaged and sent by truck to three warehouses (W1, W2, W3) around the country, in response to replenishment orders. Each of the factories has a known monthly production capacity, and the three regional warehouses have placed their demands for next month. The following tables summarize the data that have been collected for this planning problem: (To) DC DI D2 1.36 (From) Factory F1 F2 F3 $1.28 1.33 1.68 Capacity 2,500 2,500 2,500 1.38 1.55 (From) DC W1 W2 W3 D1 $0.60 0.57 0.42 0.30 0.32 0.40 D2 Requirement 1,200 1,300 1,400 Knowing the unit transportation costs of the goods from factories to DCs and from DCs to warehouses, One Desk Company is interested in scheduling its material flow at the minimum possible cost. Provide the standard form (i.e., define decision variables, objective function, and all constraints mathematically)