The Cosmic Computer Company (CCC) has three microcomputer assembly plants. The one located in San Francisco has a monthly production capacity of 1700 units, the one in Los Angeles 2000 units, and the one in Phoenix 1700 units. The microcomputers are sold through four retail stores. The one located in San Diego has placed an order of 1700 units for the th, the one located in Barstow 1000 units, the one Tucson 1500 units, and the one in Dallas 1200 units. The cost of shipping one microcomputer from each assembly plant to each of the different retail stores is given in the following table: STORES PLANTS SAN DIEGO BARSTOW TUCSON DALLAS San Francisco Los Angeles 10 Phoenix w con 0 Letting Xi; = Number of microcomputer shipped from Plant i to Storej (i=1,2,3 refer respectively to the Plants in San Francisco, Los Angeles, and Phoenix; whereas, j=1,2,3,4 refer respectively to the stores in San Diego, Barstow, Tucson, and Dallas), CCC would like to solve a transportation problem that would minimize total shipping cost of transporting computers from the plants to the store. Formulate as a linear programming