Please help solve this, show all work and answers. Please show excel formulas used.

1. A company will be producing the same new product at two different factories, and then the product must be shipped to two warehouses. Factory 1 can send an unlimited amount by rail to warehouse 1 only, whereas factory 2 can send an unlimited amount by rail to warehouse 2 only. However, independent truckers can be used to ship up to 50 units from each factory to a distribution center, from which up to 50 units can be shipped to each warehouse. The shipping cost per unit for each alternative is shown in the following table, along with the amounts to be produced at the factories and the amounts needed at the warehouses. Formulate the network representation of this problem as a minimum cost flow problem, and use Excel to find a solution that minimizes costs. From To Dist. Center Warehouse 1 Warehouse 2 Output Factory 1 Factory 2 Dist. Center 2 Allocation 90 60 2. Reconsider the minimum cost flow problem above. (a) Obtain an initial BF Solution by solving the feasible spanning tree that corresponds to using just the two rail lines plus Factory 1 shipping to Warehouse 2 via the Distribution Center. (b) Use the Network Simplex Method to solve this