A network diagram between five locations is shown. The left-hand side of the graph is labeled "Supplies" and lists Jefferson City and Omaha. The right-hand side of the graph is labeled "Demands" and lists Des Moines, Kansas City, and St. Louis. Lines are shown between various locations. The following list contains the numbers placed on the graph. Jefferson City: 35 Omaha: 25 Des Moines: 20 Kansas City: 15 St. Louis: 25 Jefferson City-Des Moines: 16 Jefferson City-Kansas City: 9 Jefferson City-St. Louis: 8 Omaha-Des Moines: 8 Omaha-Kansas City: 11 Omaha-St. Louis: 25 The supplies, demands, and transportation costs per unit are shown on the network. (a) Develop a linear programming model for this problem; be sure to define the variables in your model. Let x11 = amount shipped from Jefferson City to Des Moines x12 = amount shipped from Jefferson City to Kansas City x13 = amount shipped from Jefferson City to St. Louis x21 = amount shipped from Omaha to Des Moines x22 = amount shipped from Omaha to Kansas City x23 = amount shipped from Omaha to St. Louis Min =? Check the subscript of your variable(s). s.t. From Jefferson City Enter inequalities using less than (<), greater than (>), less than or equal (), or greater than or equal (). From Omaha To Des Moines = Solve the linear program to determine the optimal solution. Amount Cost Jefferson City-Des Moines amount and cost? Jefferson City-Kansas Ci