Consider the following network represtntation of a transportaben problem. The supples, demands, and transportation costs per unit are shown on the network. The optimal (cost minimizing) distrioution plan is gi Jefferson Ci-y ta Karssss City, x13= amaunt shipped from Jeffersari City to Gt. Louis, x21= arnount shipped rom Omaha ta Des Moiress, Use the procedure deseribed in Section 12.7 to try to ind an alternative eptimal solution, (Round your answers to the nearest integer.) (x11,x12,x13,x21,x22,x23)=(.