Problem 6-02 (Algorithmic) Consider the following network representation of a transportation problem: 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. If constant is "1", it must be entered in the box. Let xij= amount shipped from supply node i to demand node j. b. Solve the linear program to determine the optimal solution. Enter " 0 " if your answer is zero. \begin{tabular}{|l|l|l|} \hline & Quantity & Cost \\ \hline Jefferson City - Des Moines & & \\ \hline Jefferson City - Kansas City & & \\ \hline Jefferson City - St. Louis & & \\ \hline Omaha - Des Moines & & \\ \hline Omaha - Kansas City & & \\ \hline Omaha - St. Louis & \\ \hline Total Cost & & \\ \hline \end{tabular}