formulate the lp for finding the shortest distance from city $1$ to city $6.($let xij represent the flow from node i to nodej.$)$ min s$.$t$.$ node $1$ flows node $2$ flows node $3$ flows node$4$ flows node $5$ flows node $6$ flows xij $>0$ for all i and jdraw the network for this problem $($i$)$ formulate the lp for finding the shortest distance from city $1$ to city $6($let x$4$ represent the flow from node i to nod j$.)$ mins.t$.$ node$1$ flows node $2$ folws node$3$ flows node $4$ flows node$5$ flows node$6$ flows x$4>0$ fpr a;; o amd j