Consider the following network representation $of$ a transportation problem.

$\begin{array}{cc}?& \text{D}\text{e}\text{s}\text{M}\text{o}\text{i}\text{n}\text{e}\text{s}\\ \text{K}\text{a}\text{n}\text{s}\text{a}\text{s}\text{C}\text{i}\text{t}\text{y}& St.\text{L}\text{o}\text{u}\text{i}\text{s}\\ \text{S}\text{u}\text{p}\text{p}\text{l}\text{y}& \text{J}\text{e}\text{f}\text{f}\text{e}\text{r}\text{s}\text{o}\text{n}\text{C}\text{i}\text{t}\text{y}\\ 37& 0\\ 44& 81\\ \text{O}\text{m}\text{a}\text{h}\text{a}& 22\\ 49& 0\\ 71& \text{D}\text{e}\text{m}\text{a}\text{n}\text{d}\\ 59& 49\\ 44& ?\end{array}$

Use the procedure described $in$ Section $12\mathrm{.}7to$ try $to$ find $an$ alternative optimal solution. $(Round$ your answers $to$ the nearest integer.$)$

$(x_{11},x_{12},x_{13},x_{21},x_{22},x_{23})=(,)$